39 research outputs found
The cost of continuity: performance of iterative solvers on isogeometric finite elements
In this paper we study how the use of a more continuous set of basis
functions affects the cost of solving systems of linear equations resulting
from a discretized Galerkin weak form. Specifically, we compare performance of
linear solvers when discretizing using B-splines, which span traditional
finite element spaces, and B-splines, which represent maximum
continuity. We provide theoretical estimates for the increase in cost of the
matrix-vector product as well as for the construction and application of
black-box preconditioners. We accompany these estimates with numerical results
and study their sensitivity to various grid parameters such as element size
and polynomial order of approximation . Finally, we present timing results
for a range of preconditioning options for the Laplace problem. We conclude
that the matrix-vector product operation is at most \slfrac{33p^2}{8} times
more expensive for the more continuous space, although for moderately low ,
this number is significantly reduced. Moreover, if static condensation is not
employed, this number further reduces to at most a value of 8, even for high
. Preconditioning options can be up to times more expensive to setup,
although this difference significantly decreases for some popular
preconditioners such as Incomplete LU factorization
Approximation of the scattering amplitude
The simultaneous solution of Ax=b and ATy=g is required in a number of situations. Darmofal and Lu have proposed a method based on the Quasi-Minimal residual algorithm (QMR). We will introduce a technique for the same purpose based on the LSQR method and show how its performance can be improved when using the Generalized LSQR method. We further show how preconditioners can be introduced to enhance the speed of convergence and discuss different preconditioners that can be used. The scattering amplitude gTx, a widely used quantity in signal processing for example, has a close connection to the above problem since x represents the solution of the forward problem and g is the right hand side of the adjoint system. We show how this quantity can be efficiently approximated using Gauss quadrature and introduce a Block-Lanczos process that approximates the scattering amplitude and which can also be used with preconditioners
Avoiding breakdown in variants of the bi-cgstab algorithm
AbstractThe bi-cg method and its variants such as cgs, bi-cgstab, and bi-cgstab2 for solving nonsymmetric linear systems of equations can suffer from breakdown. By using the theory of the formal orthogonal polynomials we present a breakdown-free bi-cgstab algorithm and a breakdown-free bi-cgstab2 algorithm. Only exact breakdowns are cured accurately
Fast iterative solution of reaction-diffusion control problems arising from chemical processes
PDE-constrained optimization problems, and the development of preconditioned iterative methods for the efficient solution of the arising matrix system, is a field of numerical analysis that has recently been attracting much attention. In this paper, we analyze and develop preconditioners for matrix systems that arise from the optimal control of reaction-diffusion equations, which themselves result from chemical processes. Important aspects in our solvers are saddle point theory, mass matrix representation and effective Schur complement approximation, as well as the outer (Newton) iteration to take account of the nonlinearity of the underlying PDEs
Spectral behavior of preconditioned non-Hermitian multilevel block Toeplitz matrices with matrix-valued symbol
This note is devoted to preconditioning strategies for non-Hermitian
multilevel block Toeplitz linear systems associated with a multivariate
Lebesgue integrable matrix-valued symbol. In particular, we consider special
preconditioned matrices, where the preconditioner has a band multilevel block
Toeplitz structure, and we complement known results on the localization of the
spectrum with global distribution results for the eigenvalues of the
preconditioned matrices. In this respect, our main result is as follows. Let
, let be the linear space of complex matrices, and let be functions whose components
belong to .
Consider the matrices , where varies
in and are the multilevel block Toeplitz matrices
of size generated by . Then
, i.e. the family
of matrices has a global (asymptotic)
spectral distribution described by the function , provided
possesses certain properties (which ensure in particular the invertibility of
for all ) and the following topological conditions are met:
the essential range of , defined as the union of the essential ranges
of the eigenvalue functions , does not
disconnect the complex plane and has empty interior. This result generalizes
the one obtained by Donatelli, Neytcheva, Serra-Capizzano in a previous work,
concerning the non-preconditioned case . The last part of this note is
devoted to numerical experiments, which confirm the theoretical analysis and
suggest the choice of optimal GMRES preconditioning techniques to be used for
the considered linear systems.Comment: 18 pages, 26 figure