Search arXivSearch

arXiv · 2311.13862

A reduced basis warm-start iterative solver for the parameterized linear systems

Abstract

This paper proposes and tests the first-ever reduced basis warm-start iterative method for the parametrized linear systems, exemplified by those discretizing the parametric partial differential equations. Traditional iterative methods are usually used to obtain the high-fidelity solutions of these linear systems. However, they typically come with a significant computational cost which becomes challenging if not entirely untenable when the parametrized systems need to be solved a large number of times (e.g. corresponding to different parameter values or time steps). Classical techniques for mitigating this cost mainly include acceleration approaches such as preconditioning. This paper advocates for the generation of an initial prediction with controllable fidelity as an alternative approach to achieve the same goal. The proposed reduced basis warm-start iterative method leverages the mathematically rigorous and efficient reduced basis method to generate a high-quality initial guess thereby decreasing the number of iterative steps. Via comparison with the iterative method initialized with a zero solution and the RBM preconditioned and initialized iterative method tested on two 3D steady-state diffusion equations, we establish the efficacy of the proposed reduced basis warm-start approach.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shijin Hou, Yanlai Chen, Yinhua Xia. 2024-01-05. A reduced basis warm-start iterative solver for the parameterized linear systems. https://arxiv.org/abs/2311.13862

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA