|
|
| Line 1: |
Line 1: |
| <div> | | <div> |
| <div class="title"><h1>Land preparation and sowing</h1></div> | | <div class="title"><h1>Land preparation and sowing</h1></div> |
| <div class="ch-navber" style="display: flex; justify-content: space-between;"> | | <div class="ch-1"> |
| <div class="center-side" style="max-width: 70%;margin-right: 3%;">
| | <h2 class="ch-title">Chapters</h2> |
| <div style="margin-top: 30px;">
| |
| <h3 style="background: #d0e5f5;padding: 15px;font-weight: 600;color: #000;font-size: 22px;margin:unset;text-align:center;">Welcome! Join us!</h3>
| |
| <div style="background: #f1f5fc;padding: 15px;font-weight: 400;color: #212529;font-size: 16px;margin:unset;line-height: 1.5;">
| |
| <p><strong>AlgoWiki</strong> is an open encyclopedia of <strong>algorithms’ properties</strong> and <strong>features of their implementations</strong> on different hardware and software platforms from mobile to extreme scale,
| |
| which allows for collaboration with the worldwide computing community on algorithm descriptions.</p>
| |
|
| |
|
| <p><strong>AlgoWiki</strong> provides an exhaustive description of an algorithm. In addition to classical algorithm properties such as serial complexity, AlgoWiki also
| | <div class="row" style="display:flex; justify-content: space-between;padding:35px 25px;"> |
| presents additional information, which together provides a complete description of the algorithm: its parallel complexity, parallel structure, determinacy, data locality,
| | <div class="column" style="max-width: 28%;"> |
| performance and scalability estimates, communication profiles for specific implementations, and many others.</p>
| | <div class="card"> |
| | | <div class="fakeimg">[[File:Img-ch.jpg|360px]]</div> |
| <p>Read More</p>
| | <div class="cha-cont"> |
| </div>
| | <span class="cha-title">Chapters 1</span> |
| | <h2>Scientific Method</h2> |
| | <p>Sunt in culpa qui officia deserunt mollit anim id est laborum consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco.</p> |
| | <div class="btn-grp"> |
| | <div class="btn btn-1">[https://www.ipcc.ch/report/ar6/wg2/downloads/report/IPCC_AR6_WGII_SummaryForPolicymakers.pdf Download Now]</div> |
| | <div class="btn btn-2">[http://localhost/mediawiki_1/index.php/Chapter_page Read More]</div> |
| | </div> |
| | </div> |
| </div> | | </div> |
|
| |
| <div style="margin-top: 30px;">
| |
| <h3 style="background: #d0e5f5;padding: 15px;font-weight: 600;color: #000;font-size: 22px;margin:unset;text-align:center;">Project structure</h3>
| |
| <div style="background: #f1f5fc;padding: 15px;font-weight: 400;color: #212529;font-size: 16px;margin:unset;line-height: 1.5;">
| |
| <p><strong>Algorithm classification</strong> — the main section of AlgoWiki which contains descriptions of all algorithms. Algorithms are added to the appropriate category of the classification, and classification is expanded with new sections if necessary.</p>
| |
| </div>
| |
| </div>
| |
|
| |
| <div style="margin-top: 30px;">
| |
| <h3 style="background: #faecc8;padding: 15px;font-weight: 600;color: #000;font-size: 22px;margin:unset;text-align:center;">Featured article</h3>
| |
| <div style="background: #faf6ed;padding: 15px;font-weight: 400;color: #212529;font-size: 16px;margin:unset;line-height: 1.5;">
| |
| <h2 class="chapter-titel">Cholesky decomposition</h2>
| |
| <p class="name">1 Properties and structure of the algorithm</p>
| |
| <p><strong>1.1 General description</strong></p>
| |
| <p><strong>The Cholesky decomposition algorithm</strong> was first proposed by Andre-Louis Cholesky (October 15, 1875 - August 31, 1918) at the end of the First World War shortly before he was killed in battle. He was a French military officer and mathematician. The idea of this algorithm was published in 1924 by his fellow officer and, later, was used by Banachiewicz in 1938 [7]. In the Russian mathematical literature, the Cholesky decomposition is also known as the square-root method [1-3] due to the square root operations used in this decomposition and not used in Gaussian elimination.</p>
| |
| <p>Originally, the Cholesky decomposition was used only for dense real symmetric positive definite matrices. At present, the application of this decomposition is much wider. For example, it can also be employed for the case of Hermitian matrices. In order to increase the computing performance, its block versions are often applied.</p>
| |
| <p>In the case of sparse matrices, the Cholesky decomposition is also widely used as the main stage of a direct method for solving linear systems. In order to reduce the memory requirements and the profile of the matrix, special reordering strategies are applied to minimize the number of arithmetic operations. A number of reordering strategies are used to identify the independent matrix blocks for parallel computing systems.</p>
| |
|
| |
|
| |
| <p><strong>1.2 Mathematical description</strong></p>
| |
| <p>Input data: a symmetric positive definite matrix A whose elements are denoted by aij).</p>
| |
|
| |
| <p>Output data: the lower triangular matrix L whose elements are denoted by lij).</p>
| |
| </div>
| |
| </div>
| |
|
| |
| <div style="margin-top: 30px;">
| |
| <h3 style="background: #d0e5f5;padding: 15px;font-weight: 600;color: #000;font-size: 22px;margin:unset;text-align:center;">Useful links</h3>
| |
| <div style="background: #f1f5fc;padding: 15px;font-weight: 400;color: #212529;font-size: 16px;margin:unset;line-height: 1.5;">
| |
| <p>[http://www.msu.ru/en/ Lomonosov Moscow State University]</p>
| |
| <p>[http://parallel.ru/index_eng.html Parallel.ru — Informational Analytical Center on supercomputers and parallel computing]</p>
| |
| <p>[http://srcc.msu.ru MSU Research computing center]</p>
| |
| <p>[http://parallel.ru/index_eng.html Parallel.ru — Informational Analytical Center on supercomputers and parallel computing]</p>
| |
| <p>International conference [http://russianscdays.org Russian Supercomputing Days]</p>
| |
| </div>
| |
| </div>
| |
|
| |
| </div> | | </div> |
|
| |
|
| <div class=" right-side" style="max-width: 30%;"> | | <div class=" column" style="max-width: 28%;"> |
| <div style="margin-top: 30px;"> | | <div class="card"> |
| <h3 style="background: #d0e5f5;padding: 15px;font-weight: 600;color: #000;font-size: 22px;margin:unset;text-align:center;">Today’s featured picture</h3> | | <div class="fakeimg">[[File:C2.jpg|360px]]</div> |
| <div style=" background: #f1f5fc;padding: 15px;font- weight: 400;color: #212529;font-size: 16px;margin:unset;line-height: 1.5;"> | | <div class="cha-cont"> |
| <p>[[File:Ch1.png|300px|thumb|left]]</p>
| | <span class="cha-title">Chapters 2</span> |
| <p>Performance for dense matrix multiplication</p>
| | <h2>Land preparation and Sowing</h2> |
| </div>
| | <p>Sunt in culpa qui officia deserunt mollit anim id est laborum consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco.</p> |
| | |
| | <div class="btn btn-1">[https://www.ipcc.ch/report/ar6/wg2/downloads/report/IPCC_AR6_WGII_SummaryForPolicymakers.pdf Download Now]</div> |
| | <div class="btn btn-2">[http://localhost/mediawiki_1/index.php/Chapter_page Read More]</div> |
| | </div> |
| </div> | | </div> |
|
| |
| <div style="margin-top: 30px;">
| |
| <h3 style="background: #d0e5f5;padding: 15px;font-weight: 600;color: #000;font-size: 22px;margin:unset;text-align:center;">Work organization</h3>
| |
| <div class="links" style="background: #f1f5fc;padding: 15px;font-weight: 400;color: #212529;font-size: 16px;margin:unset;line-height: 1.5;">
| |
| <p>[http://www.msu.ru/en/ Description of algorithm properties and structure]</p>
| |
| <p style="color:#ba0000 !important;">[http://parallel.ru/index_eng.html Guides to writing sections of the algorithm’s description]</p>
| |
| <p>[http://srcc.msu.ru Glossary]</p>
| |
| <p>[http://srcc.msu.ru Help with editing]</p>
| |
| </div>
| |
| </div> | | </div> |
| | </div> |
|
| |
|
| <div style="margin-top: 30px;"> | | <div class="column" style="max-width: 28%;"> |
| <h3 style="background: #d0e5f5;padding: 15px;font-weight: 600;color: #000;font-size: 22px;margin:unset;text-align:center;">Readiness of articles</h3>
| | <div class="card"> |
| <div class=" links" style=" background: #f1f5fc;padding: 15px;font-weight: 400;color: #212529;font- size: 16px;margin:unset;line-height: 1.5;"> | | <div class="fakeimg">[[File:C1.jpg|360px]]</div> |
| <p><strong>Finished articles:</strong></p>
| | |
| <ul>
| | <span class="cha-title">Chapters 3</span> |
| <li><p> [http://www. msu. ru/en/ Description of algorithm properties and structure]</p>< /li> | | <h2>Crop and Tree Intensification</h2> |
| <li><p style="color:#ba0000 !important;">[http://parallel.ru/index_eng.html Guides to writing sections of the algorithm’s description]</p></li>
| | <p> Sunt in culpa qui officia deserunt mollit anim id est laborum consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim |
| <li><p>[http://srcc.msu.ru Glossary]</p></li>
| | veniam, quis nostrud exercitation ullamco.</p> |
| <li><p>[http://srcc.msu.ru Help with editing]</p></li>
| | <div class="btn-grp"> |
| </ul>
| | <div class="btn btn-1">[https://www.ipcc.ch/report/ar6/wg2/downloads/report/IPCC_AR6_WGII_SummaryForPolicymakers.pdf Download Now]</div> |
| | <div class="btn btn-2">[http://localhost/mediawiki_1/index.php/Chapter_page Read More]</div> |
| | </div> |
| </div> | | </div> |
| | </div> |
| </div> | | </div> |
| </div>
| |
| </div> | | </div> |
| | </div> |
| </div> | | </div> |
