
Zhang Leihong
Followers: 0 Following: 0
Feeds
제출됨
The b-d-Lawson method
b-d-Lawson is a method for the interpolation constrained rational minimax approximation.
13일 전 | 다운로드 수: 3 |
제출됨
v-AAA-Lawson
A AAA-type with Lawson's iteration. It computes matrix-valued rational approximants, poles and zeros of user-specific rational t...
4개월 전 | 다운로드 수: 2 |
제출됨
d-Lawson method
d_lawson solves the discrete minimax rational approximation. It is based on the dual problem of the original minimax approximati...
9개월 전 | 다운로드 수: 2 |
제출됨
An interior-point method for complex polynomial minimax
The package is to compute the polynomial minimax approximation for a continuous function or discrete case in the complex plane.
대략 1년 전 | 다운로드 수: 1 |