On efficient numerical approximation of the bilinear form c^*A^-1b
From MaRDI portal
Publication:3095074
Recommendations
- Block conjugate gradient type methods for the approximation of bilinear form \(C^HA^{-1}B\)
- Estimates for the bilinear form \(x^T A^{-1} y\) with applications to linear algebra problems
- A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching
- Estimation of the bilinear form y^ f(A)x for Hermitian matrices
- Aitken's method for estimating bilinear forms arising in applications
Cited in
(12)- 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
- Estimation of the bilinear form y^ f(A)x for Hermitian matrices
- Estimates for the bilinear form \(x^T A^{-1} y\) with applications to linear algebra problems
- Preconditioned multishift BiCG for \(\mathcal{H}_2\)-optimal model reduction
- A literature survey of matrix methods for data science
- Error estimates for quadrature rules based on the Arnoldi process
- Efficient training of Gaussian processes with tensor product structure
This page was built for publication: On efficient numerical approximation of the bilinear form \(c^*A^{-1}b\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095074)
