d-Lawson method
d_lawson solves the discrete minimax rational approximation. It is based on the dual problem of the original minimax approximation.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
- 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.
Cite As
Zhang Leihong (2026). d-Lawson method (https://in.mathworks.com/matlabcentral/fileexchange/167176-d-lawson-method), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.0.0 (7.25 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0 |
