Pages that link to "Item:Q1774498"
From MaRDI portal
The following pages link to Computational error and complexity in science and engineering (Q1774498):
Displayed 13 items.
- Solving linear program as linear system in polynomial time (Q552124) (← links)
- A quasi-shrinking rectangle algorithm for complex zeros of a function (Q870141) (← links)
- Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era (Q928099) (← links)
- Heartfelt tribute to the person with an amazing legacy (Q943700) (← links)
- Golden ratio versus pi as random sequence sources for Monte Carlo integration (Q949528) (← links)
- Zero-clusters of polynomials: best approach in supercomputing era (Q961599) (← links)
- Golden ratio in science, as random sequence source, its computation and beyond (Q1004690) (← links)
- How modeling can attract experimentalists to improve solar cell's efficiency: Divide-and-conquer approach (Q1021711) (← links)
- Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era (Q2390176) (← links)
- Interpolation for nonlinear BVP in circular membrane with known upper and lower solutions (Q2475890) (← links)
- Chemical equation balancing: an integer programming approach (Q2476121) (← links)
- Gas flow problem: solving non-linear BVP with given lower-upper solutions interactively (Q3437362) (← links)
- (Q4556679) (← links)