d-Lawson method
d_lawson solves the discrete minimax rational approximation. It is based on the dual problem of the original minimax approximation.
- d_lawson.m is a Matlab function for computing the discrete minimax rational approximation. It is based on the dual problem of the original minimax approximation.
- The M-file test_d_lawson.m is a test for the method d_lawson. It contains 7 examples.
---
Reference:
L.-H. Zhang, L. Yang, W. H. Yang and Y.-N. Zhang, A convex dual programming for the rational minimax approximation and Lawson's iteration, 2023, URL https://arxiv.org/pdf/2308.06991v1.
引用格式
Zhang Leihong (2026). d-Lawson method (https://ww2.mathworks.cn/matlabcentral/fileexchange/167176-d-lawson-method), MATLAB Central File Exchange. 检索时间: .
| 版本 | 已发布 | 发行说明 | Action |
|---|---|---|---|
| 1.0.0 |
