A low-rank matrix approach to compute polynomial approximations of smooth two-dimensional functions

DOI10.1007/S11786-024-00581-2zbMATH Open1546.33008MaRDI QIDQ6612104

P. B. Vasconcelos, José A. O. Matos, Nilson J. Lima

Publication date: 30 September 2024

Published in: Mathematics in Computer Science (Search for Journal in Brave)

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites Work

• Title not available (Why is that?)
• Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
• Introduction to hierarchical matrices with applications.
• Solving differential and integral equations with tau method
• Hybrid cross approximation of integral operators
• Spectral Methods
• Literature survey on low rank approximation of matrices
• Continuous analogues of matrix factorizations
• An Extension of Chebfun to Two Dimensions

This page was built for publication: A low-rank matrix approach to compute polynomial approximations of smooth two-dimensional functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612104)