Skip to search formSkip to main contentSkip to account menu

Condition number

Known as: Conditioning number, Cond, Condition numbers 
In the field of numerical analysis, the condition number of a function with respect to an argument measures how much the output value of the function… 
Wikipedia (opens in a new tab)

Related topics

Related topics

46 relations
AlgorithmBDDCCMA-ESCholesky decomposition

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Fast matrix completion without the condition number
We give the first algorithm for Matrix Completion whose running time and sample complexity is polynomial in the rank of the… 
Highly Cited
2011
Highly Cited
2011
A hierarchical approach to adaptive local refinement in isogeometric analysis
Highly Cited
2007
Highly Cited
2007
Arbitrary high order non-oscillatory finite volume schemes on unstructured meshes for linear hyperbolic systems
Highly Cited
2005
Highly Cited
2005
An algebraic theory for primal and dual substructuring methods by constraints
Review
2004
Review
2004
Line broadening analysis using integral breadth methods: a critical review
Integral breadth methods for line profile analysis are reviewed, including modifications of the Williamson–Hall method recently… 
Highly Cited
2001
Highly Cited
2001
Sensitivity analysis in model calibration: GSA-GLUE approach
Highly Cited
2000
Highly Cited
2000
Circumventing the ill-conditioning problem with multiquadric radial basis functions: Applications to elliptic partial differential equations
Highly Cited
1999
Highly Cited
1999
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming
Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP… 
Highly Cited
1992
Highly Cited
1992
How Fast are Nonsymmetric Matrix Iterations?
Three leading iterative methods for the solution of nonsymmetric systems of linear equations are CGN (the conjugate gradient… 
Highly Cited
1988
Highly Cited
1988
Algorithms for polynomials in Bernstein form
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)