A greedy algorithm for the optimal basis problem

DOI10.1007/BF02510241MaRDI QIDQ1371665zbMATH OpenOpenAlexFDO

Authors Oleg Burdakov

Publication date 13 November 1997

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02510241

zbMATH Keywords

greedy algorithmsystems of nonlinear equationsminimum spanning tree problemHadamard condition numbermultipoint interpolation methodsoptimal basis problem

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Recommendations

• The Null Space Problem I. Complexity
• Optimally stable multivariate bases
• The Null Space Problem II. Algorithms
• Interpolation problems on algebraic manifolds
• scientific article; zbMATH DE number 2217387

Cites work

• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• scientific article; zbMATH DE number 653035 (Why is no real title available?)
• scientific article; zbMATH DE number 686913 (Why is no real title available?)
• scientific article; zbMATH DE number 1153890 (Why is no real title available?)
• scientific article; zbMATH DE number 1552017 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 846277 (Why is no real title available?)
• scientific article; zbMATH DE number 3224188 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A Simple Estimate of the Condition Number of a Linear System
• A note on two problems in connexion with graphs
• Matrix multiplication via arithmetic progressions
• Network flow, transportation and scheduling. Theory and algorithms
• On Superlinear Convergence of Some Stable Variants of the Secant Method
• Stable symmetric secant methods with restart
• Stable versions of the secants method for solving systems of equations
• Two Hadamard numbers for matrices

Cited in

(6)

• Multipoint secant and interpolation methods with nonmonotone line search for solving systems of nonlinear equations
• scientific article; zbMATH DE number 2016952 (Why is no real title available?)
• Greedy bases are best for \(m\)-term approximation
• scientific article; zbMATH DE number 610255 (Why is no real title available?)
• The thresholding greedy algorithm, greedy bases, and duality
• An active-set trust-region method for derivative-free nonlinear bound-constrained optimization

Describes a project that uses

Uses Software

• mctoolbox

This page was built for publication: A greedy algorithm for the optimal basis problem

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