On the Optimal Solution of Large Linear Systems

DOI10.1145/828.830MaRDI QIDQ3765108zbMATH OpenOpenAlexFDO

Authors J. F. Traub, H. Woźniakowski

Publication date 1984

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/828.830

zbMATH Keywords

bounded condition numberChebyshev algorithmconjugate gradientKrylov informationlarge linear systemslower boundsmatrix-vector multiplicationminimal residualoptimal algorithmsorthogonally invariant matricessuccessive approximationsymmetric positive definite matrices

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Recommendations

• Minimal residual algorithm and matrix-vector information
• A minimum residual algorithm for solving linear systems
• On the optimality of Krylov information
• scientific article; zbMATH DE number 992795
• Approximate solutions and eigenvalue bounds from Krylov subspaces

Cited in

(35)

• Optimal recovery on the classes of functions with bounded mixed derivative
• On the power of standard information for \(L_{\infty}\) approximation in the randomized setting
• Is Gauss quadrature optimal for analytic functions?
• Optimal algorithms for image understanding: Current status and future plans
• On the optimal solution of large eigenpair problems
• A survey of information-based complexity
• Complexity of fixed points. I
• Study of linear information for classes of polynomial equations
• On the optimal error of algorithms for solving scalar autonomous ODE
• On optimality of Krylov's information when solving linear operator equations
• The convergence rate of the sandwich algorithm for approximating convex functions
• A minimal residual class of algorithms for linear systems
• The -complexity of the approximate solution of integral equations with isotropic kernels.
• A convex optimization approach for solving large scale linear systems
• Minimal residual algorithm and matrix-vector information
• On some iteration functions for the simultaneous computation of multiple complex polynomial zeros
• Hadamard and Schwarz type theorems and optimal recovery in spaces of analytic functions
• A doubly optimized solution of linear equations system expressed in an affine Krylov subspace
• Adaption allows efficient integration of functions with unknown singularities
• Some results on the complexity of numerical integration
• scientific article; zbMATH DE number 992795 (Why is no real title available?)
• scientific article; zbMATH DE number 4203568 (Why is no real title available?)
• Some basic information on information-based complexity theory
• Perspectives on information-based complexity
• scientific article; zbMATH DE number 653107 (Why is no real title available?)
• scientific article; zbMATH DE number 741108 (Why is no real title available?)
• Joint spectra of Toeplitz operators and optimal recovery of analytic functions
• Exact orders of computational (numerical) diameters in problems of reconstructing functions and sampling solutions of the Klein-Gordon equation from Fourier coefficients
• Binary solutions to large systems of linear equations
• Quantum algorithm and circuit design solving the Poisson equation
• Fast multiplication of a recursive block Toeplitz matrix by a vector and its application
• On the optimality of Krylov information
• Stochastic recovery problem
• Can adaption help on the average?
• Optimal order of convergence and (in)tractability of multivariate approximation of smooth functions

This page was built for publication: On the Optimal Solution of Large Linear Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765108)