<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
    <record>
        <controlfield tag="001">88253</controlfield>
        <controlfield tag="005">20200716101605.0</controlfield>
        <datafield tag="024" ind1="7" ind2=" ">
            <subfield code="2">doi</subfield>
            <subfield code="a">10.1137/18M1194407</subfield>
        </datafield>
        <datafield tag="024" ind1="8" ind2=" ">
            <subfield code="2">sideral</subfield>
            <subfield code="a">116359</subfield>
        </datafield>
        <datafield tag="037" ind1=" " ind2=" ">
            <subfield code="a">ART-2019-116359</subfield>
        </datafield>
        <datafield tag="041" ind1=" " ind2=" ">
            <subfield code="a">eng</subfield>
        </datafield>
        <datafield tag="100" ind1=" " ind2=" ">
            <subfield code="a">Pe de la Riva, Álvaro</subfield>
            <subfield code="u">Universidad de Zaragoza</subfield>
        </datafield>
        <datafield tag="245" ind1=" " ind2=" ">
            <subfield code="a">A Robust Multigrid Solver for Isogeometric Analysis Based on Multiplicative Schwarz Smoothers</subfield>
        </datafield>
        <datafield tag="260" ind1=" " ind2=" ">
            <subfield code="c">2019</subfield>
        </datafield>
        <datafield tag="506" ind1="0" ind2=" ">
            <subfield code="a">Access copy available to the general public</subfield>
            <subfield code="f">Unrestricted</subfield>
        </datafield>
        <datafield tag="520" ind1="3" ind2=" ">
            <subfield code="a">The design of fast solvers for isogeometric analysis is receiving a lot of attention due to the challenge that offers to find an algorithm with a robust convergence with respect to the spline degree. Here, we analyze the application of geometric multigrid methods to this type of discretization, and we propose a multigrid approach based on overlapping multiplicative Schwarz methods as smoothers. The size of the blocks considered within these relaxation procedures is adapted to the spline degree. A simple multigrid V-cycle with only one step of presmoothing results in a very efficient algorithm, whose convergence is independent on the spline degree and the spatial discretization parameter. Local Fourier analysis is shown to be very useful for the understanding of the problems encountered in the design of a robust multigrid method for IGA, and it is performed to support the good convergence properties of the proposed solver. In fact, an analysis for any spline degree and an arbitrary size of the blocks within the Schwarz smoother is presented for the one-dimensional case. The efficiency of the solver is also demonstrated through several numerical experiments, including a two-dimensional problem on a nontrivial computational domain.</subfield>
        </datafield>
        <datafield tag="536" ind1=" " ind2=" ">
            <subfield code="9">info:eu-repo/grantAgreement/ES/DGA-FEDER/E24-17R</subfield>
            <subfield code="9">info:eu-repo/grantAgreement/EC/H2020/705402/EU/Efficient numerical methods for deformable porous media. Application to carbon dioxide storage./poro sos</subfield>
            <subfield code="9">This project has received funding from the European Union’s Horizon 2020 research and innovation program under grant agreement No H2020 705402-poro sos</subfield>
            <subfield code="9">info:eu-repo/grantAgreement/ES/MCYT-FEDER/MTM2016-75139-R</subfield>
        </datafield>
        <datafield tag="540" ind1=" " ind2=" ">
            <subfield code="9">info:eu-repo/semantics/openAccess</subfield>
            <subfield code="a">All rights reserved</subfield>
            <subfield code="u">http://www.europeana.eu/rights/rr-f/</subfield>
        </datafield>
        <datafield tag="590" ind1=" " ind2=" ">
            <subfield code="a">1.976</subfield>
            <subfield code="b">2019</subfield>
        </datafield>
        <datafield tag="591" ind1=" " ind2=" ">
            <subfield code="a">MATHEMATICS, APPLIED</subfield>
            <subfield code="b">47 / 260 = 0.181</subfield>
            <subfield code="c">2019</subfield>
            <subfield code="d">Q1</subfield>
            <subfield code="e">T1</subfield>
        </datafield>
        <datafield tag="592" ind1=" " ind2=" ">
            <subfield code="a">1.928</subfield>
            <subfield code="b">2019</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Computational Mathematics</subfield>
            <subfield code="c">2019</subfield>
            <subfield code="d">Q1</subfield>
        </datafield>
        <datafield tag="593" ind1=" " ind2=" ">
            <subfield code="a">Applied Mathematics</subfield>
            <subfield code="c">2019</subfield>
            <subfield code="d">Q1</subfield>
        </datafield>
        <datafield tag="655" ind1=" " ind2="4">
            <subfield code="a">info:eu-repo/semantics/article</subfield>
            <subfield code="v">info:eu-repo/semantics/publishedVersion</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="0">(orcid)0000-0002-1598-2831</subfield>
            <subfield code="a">Rodrigo, Carmen</subfield>
            <subfield code="u">Universidad de Zaragoza</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="0">(orcid)0000-0002-9777-5245</subfield>
            <subfield code="a">Gaspar Lorenz, Francisco</subfield>
            <subfield code="u">Universidad de Zaragoza</subfield>
        </datafield>
        <datafield tag="710" ind1="2" ind2=" ">
            <subfield code="1">2005</subfield>
            <subfield code="2">595</subfield>
            <subfield code="a">Universidad de Zaragoza</subfield>
            <subfield code="b">Dpto. Matemática Aplicada</subfield>
            <subfield code="c">Área Matemática Aplicada</subfield>
        </datafield>
        <datafield tag="773" ind1=" " ind2=" ">
            <subfield code="g">41, 5 (2019), S321–S345</subfield>
            <subfield code="p">SIAM j. sci. comput.</subfield>
            <subfield code="t">SIAM JOURNAL ON SCIENTIFIC COMPUTING</subfield>
            <subfield code="x">1064-8275</subfield>
        </datafield>
        <datafield tag="856" ind1="4" ind2=" ">
            <subfield code="s">1688321</subfield>
            <subfield code="u">http://zaguan.unizar.es/record/88253/files/texto_completo.pdf</subfield>
            <subfield code="y">Versión publicada</subfield>
        </datafield>
        <datafield tag="856" ind1="4" ind2=" ">
            <subfield code="s">421144</subfield>
            <subfield code="u">http://zaguan.unizar.es/record/88253/files/texto_completo.jpg?subformat=icon</subfield>
            <subfield code="x">icon</subfield>
            <subfield code="y">Versión publicada</subfield>
        </datafield>
        <datafield tag="909" ind1="C" ind2="O">
            <subfield code="o">oai:zaguan.unizar.es:88253</subfield>
            <subfield code="p">articulos</subfield>
            <subfield code="p">driver</subfield>
        </datafield>
        <datafield tag="951" ind1=" " ind2=" ">
            <subfield code="a">2020-07-16-09:54:23</subfield>
        </datafield>
        <datafield tag="980" ind1=" " ind2=" ">
            <subfield code="a">ARTICLE</subfield>
        </datafield>
    </record>

    
</collection>