A greedy algorithm for the optimal basis problem

DOI10.1007/BF02510241zbMath0886.65043OpenAlexW1999653997MaRDI QIDQ1371665

Oleg P. 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

Related Items (2)

An active-set trust-region method for derivative-free nonlinear bound-constrained optimization ⋮ Multipoint secant and interpolation methods with nonmonotone line search for solving systems of nonlinear equations

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Matrix multiplication via arithmetic progressions
• Network flow, transportation and scheduling. Theory and algorithms
• Stable symmetric secant methods with restart
• Two Hadamard numbers for matrices
• On Superlinear Convergence of Some Stable Variants of the Secant Method
• Stable versions of the secants method for solving systems of equations
• A Simple Estimate of the Condition Number of a Linear System

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