On Efficient Numerical Approximation of the Bilinear Form $c^*A^{-1}b$
From MaRDI portal
Publication:3095074
DOI10.1137/090753723zbMath1227.65033MaRDI QIDQ3095074
Publication date: 28 October 2011
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090753723
numerical experiments; conjugate gradient method; bilinear forms; model reduction; scattering amplitude; Krylov subspace methods; Lanczos algorithm; Arnoldi algorithm; method of moments; biconjugate gradient method; Gauss-Christoffel quadrature
65F10: Iterative numerical methods for linear systems
15A63: Quadratic and bilinear forms, inner products
Related Items
Preconditioned Multishift BiCG for $\mathcal{H}_2$-Optimal Model Reduction, A literature survey of matrix methods for data science, Estimation of the bilinear form \(y^\ast f(A)x\) for Hermitian matrices, Towards backward perturbation bounds for approximate dual Krylov subspaces, Block conjugate gradient type methods for the approximation of bilinear form \(C^HA^{-1}B\), Goal-oriented mesh adaptation method for nonlinear problems including algebraic errors, On efficient numerical solution of linear algebraic systems arising in goal-oriented error estimates, A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching, New matrix function approximations and quadrature rules based on the Arnoldi process
Uses Software
