https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Buron_et_al_2023a 2026-04-16T17:05:33Z Revision history for this page on the wiki MediaWiki 1.27.0-wmf.10 https://www.scipedia.com/wd/index.php?title=Buron_et_al_2023a&diff=286824&oldid=prev 2023-11-02T12:58:31Z

<p>JSanchez moved page <a href="/public/Draft_Sanchez_Pinedo_833551052" class="mw-redirect" title="Draft Sanchez Pinedo 833551052">Draft Sanchez Pinedo 833551052</a> to <a href="/public/Buron_et_al_2023a" title="Buron et al 2023a">Buron et al 2023a</a></p> <table class="diff diff-contentalign-left" data-mw="interface"> <tr style='vertical-align: top;' lang='en'> <td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 12:58, 2 November 2023</td> </tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div> </td></tr></table>

JSanchez https://www.scipedia.com/wd/index.php?title=Buron_et_al_2023a&diff=286823&oldid=prev 2023-11-02T12:58:22Z

<p></p> <table class="diff diff-contentalign-left" data-mw="interface"> <col class='diff-marker' /> <col class='diff-content' /> <col class='diff-marker' /> <col class='diff-content' /> <tr style='vertical-align: top;' lang='en'> <td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 12:58, 2 November 2023</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l3" >Line 3:</td> <td colspan="2" class="diff-lineno">Line 3:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>In this work, we propose iterative modal solvers to generate multiphysics finite element reduced order models. We consider the strongly coupled problems defined through differential-algebraic equations with sparse discrete operators. Piezoelectric models are common examples of such problems. The approach we propose is based on the Model Order Reduction (MOR) after Implicit Schur method [1] which is used for the Krylov subspace reduction of piezoelectric devices. While their work uses the knowledge of the loading applied to the model to generate a Krylov subspace reduction basis, we propose to build a reduction basis with a priori unknown loading by modal synthesis. The basis is built from the eigenvectors of the problem after the static condensation by Schur complement of one of the physics. Typically, the Schur complement matrix is computed explicitly and it leads to dense operators [2] which limit the problem scales that can be studied due to large memory requirements and costly computations for the eigensolver used afterward. For Krylov-based eigensolvers, the most computationally difficult step is to obtain a basis spanning the eigenspace of the problem on the considered eigenvalue range. By generalizing the MOR after Implicit Schur method, this basis can be constructed by an iterative procedure using the original sparse operators instead of the dense condensed operators. The original model may be significantly larger compared to the condensed model for typical cases. However, keeping the sparsity is a critical computational advantage for the considered problems. This method is minimally intrusive for the eigensolvers that only require the implementation of a matrix-vector product. Comparing this implicit Schur complement approach to the explicit Schur complement approach shows large computational cost reductions. It also underlines the problem scale limitations of the explicit approach even on high performance computing hardware.</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>In this work, we propose iterative modal solvers to generate multiphysics finite element reduced order models. We consider the strongly coupled problems defined through differential-algebraic equations with sparse discrete operators. Piezoelectric models are common examples of such problems. The approach we propose is based on the Model Order Reduction (MOR) after Implicit Schur method [1] which is used for the Krylov subspace reduction of piezoelectric devices. While their work uses the knowledge of the loading applied to the model to generate a Krylov subspace reduction basis, we propose to build a reduction basis with a priori unknown loading by modal synthesis. The basis is built from the eigenvectors of the problem after the static condensation by Schur complement of one of the physics. Typically, the Schur complement matrix is computed explicitly and it leads to dense operators [2] which limit the problem scales that can be studied due to large memory requirements and costly computations for the eigensolver used afterward. For Krylov-based eigensolvers, the most computationally difficult step is to obtain a basis spanning the eigenspace of the problem on the considered eigenvalue range. By generalizing the MOR after Implicit Schur method, this basis can be constructed by an iterative procedure using the original sparse operators instead of the dense condensed operators. The original model may be significantly larger compared to the condensed model for typical cases. However, keeping the sparsity is a critical computational advantage for the considered problems. This method is minimally intrusive for the eigensolvers that only require the implementation of a matrix-vector product. Comparing this implicit Schur complement approach to the explicit Schur complement approach shows large computational cost reductions. It also underlines the problem scale limitations of the explicit approach even on high performance computing hardware.</div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"></ins></div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">== Full Paper ==</ins></div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">&lt;pdf&gt;Media:Draft_Sanchez Pinedo_833551052pap_102.pdf&lt;/pdf&gt;</ins></div></td></tr> </table>

JSanchez https://www.scipedia.com/wd/index.php?title=Buron_et_al_2023a&diff=286821&oldid=prev 2023-11-02T12:58:19Z

<p></p> <table class="diff diff-contentalign-left" data-mw="interface"> <col class='diff-marker' /> <col class='diff-content' /> <col class='diff-marker' /> <col class='diff-content' /> <tr style='vertical-align: top;' lang='en'> <td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 12:58, 2 November 2023</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1" >Line 1:</td> <td colspan="2" class="diff-lineno">Line 1:</td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">&#160; &#160; &#160; &#160; &#160; &#160; &#160; &#160; &#160; &#160; &#160; &#160; &#160; &#160; &#160; &#160; </ins></div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">==Abstract==</ins></div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">In this work, we propose iterative modal solvers to generate multiphysics finite element reduced order models. We consider the strongly coupled problems defined through differential-algebraic equations with sparse discrete operators. Piezoelectric models are common examples of such problems. The approach we propose is based on the Model Order Reduction (MOR) after Implicit Schur method [1] which is used for the Krylov subspace reduction of piezoelectric devices. While their work uses the knowledge of the loading applied to the model to generate a Krylov subspace reduction basis, we propose to build a reduction basis with a priori unknown loading by modal synthesis. The basis is built from the eigenvectors of the problem after the static condensation by Schur complement of one of the physics. Typically, the Schur complement matrix is computed explicitly and it leads to dense operators [2] which limit the problem scales that can be studied due to large memory requirements and costly computations for the eigensolver used afterward. For Krylov-based eigensolvers, the most computationally difficult step is to obtain a basis spanning the eigenspace of the problem on the considered eigenvalue range. By generalizing the MOR after Implicit Schur method, this basis can be constructed by an iterative procedure using the original sparse operators instead of the dense condensed operators. The original model may be significantly larger compared to the condensed model for typical cases. However, keeping the sparsity is a critical computational advantage for the considered problems. This method is minimally intrusive for the eigensolvers that only require the implementation of a matrix-vector product. Comparing this implicit Schur complement approach to the explicit Schur complement approach shows large computational cost reductions. It also underlines the problem scale limitations of the explicit approach even on high performance computing hardware.</ins></div></td></tr> <!-- diff cache key mw_drafts_scipedia-sc_mwd_:diff:version:1.11a:oldid:286820:newid:286821 --> </table>

JSanchez https://www.scipedia.com/wd/index.php?title=Buron_et_al_2023a&diff=286820&oldid=prev 2023-11-02T12:58:17Z

<p>Created blank page</p> <p><b>New page</b></p><div></div>

JSanchez