Pages that link to "Item:Q2504583"
From MaRDI portal
The following pages link to Optimization-based computation of analytic interpolants of bounded complexity (Q2504583):
Displaying 7 items.
- Optimization of zero-pole interlacing for indirect discrete approximations of noninteger order operators (Q316104) (← links)
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- Lower complexity bounds for interpolation algorithms (Q2431336) (← links)
- Sensitivity shaping with degree constraint by nonlinear least-squares optimization (Q2486101) (← links)
- Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts (Q2985840) (← links)
- A Convex Optimization Approach to the Rational Covariance Extension Problem (Q4237219) (← links)
- (Q4888611) (← links)