Symbol kappa
kappa is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.
Read this term in its guide →Published equation contexts
Why this formula appears here
If is large, small errors in the input data or in floating-point rounding can produce large errors in the computed solution, independent of which algorithm is used to solve the system — a property of the problem, not the solver. Bringing formal verification to numerical software means proving that an implementation’s actual rounding behavior stays within a bound consistent with this kind of analysis, not just testing it empirically on sample inputs. That is a much harder and more labor-intensive proof target than a compiler’s semantic-preservation proof, because floating-point arithmetic is non-associative and the correctness statement has to quantify over rounding error explicitly…
Read the representative guide
Symbol A
A is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.
Read this term in its guide →How to interpret it
Read this expression with the definitions, units, and assumptions supplied by the article.
Research cited beside this formula
Published contexts (1)
A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.
Equation 7 · Mathematics
Mathematics, Proof, and Scientific Computation in 2035: Scenarios, Signals, and Falsifiable Predictions
This mathematical expression combines the displayed quantities; its precise role follows from the surrounding article text.
If is large, small errors in the input data or in floating-point rounding can produce large errors in the computed solution, independent of which algorithm is used to solve the system — a property of the problem, not the solver. Bringing formal verification to numerical software means proving that an implementation’s actual rounding behavior stays within a bound consistent with this kind of analysis, not just testing it empirically on sample inputs. That is a much harder and more labor-intensive proof target than a compiler’s semantic-preservation proof, because floating-point arithmetic is non-associative and the correctness statement has to quantify over rounding error explicitly…
Equation guide → · Article →