Pages that link to "Item:Q455889"
From MaRDI portal
The following pages link to An algorithm for computing a Padé approximant with minimal degree denominator (Q455889):
Displaying 12 items.
- A tabular methodology to identify minimal row degrees for matrix Padé approximants (Q390437) (← links)
- Padé approximants for finite time ruin probabilities (Q475654) (← links)
- Robust Padé approximants may have spurious poles (Q476129) (← links)
- Minimal vector Padé approximation (Q923282) (← links)
- Error estimation on the Padé approximation of transfer functions via the Lanczos process (Q1279546) (← links)
- A new method for deriving adjacent approximants in the Padé table (Q1425671) (← links)
- Fast calculation of Laurent expansions for matrix inverses (Q1674697) (← links)
- Faint and clustered components in exponential analysis (Q2424843) (← links)
- Algebraic properties of robust Padé approximants (Q2514844) (← links)
- (Q5127284) (← links)
- A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation (Q5146689) (← links)
- Stabilized time-series expansions for high-order finite element solutions of partial differential equations (Q6590531) (← links)