๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A parallel algorithm for discrete least squares rational approximation

โœ Scribed by Marc Van Barel; Adhemar Bultheel

Publisher
Springer-Verlag
Year
1992
Tongue
English
Weight
889 KB
Volume
63
Category
Article
ISSN
0029-599X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An approximation algorithm for least med
An approximation algorithm for least median of squares regression
โœ Clark F. Olson ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 486 KB

Least median of squares (LMS) regression is a robust method to fit equations to observed data (typically in a linear model). This paper describes an approximation algorithm for LMS regression. The algorithm generates a regression solution with median residual no more than twice the optimal median re

CXFTV2: A Fortran subroutine for the dis
CXFTV2: A Fortran subroutine for the discrete least squares convex approximation
โœ I.C. Demetriou ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 824 KB

A Fortan subroutine calculates the least squares approximation to n data values con~n~ag ~ erro~ ~ to non-negative second divided differences (convexity). The method employs a dual active set qua~ta~ technique that allows several corcavities of an iterate to ,he corrected simul~..eo'~ly, whk:h is a

A coarse-grained parallel QR-factorizati
A coarse-grained parallel QR-factorization algorithm for sparse least squares problems
โœ Tz. Ostromsky; P.C. Hansen; Z. Zlatev ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 599 KB

A sparse QR-factorization algorithm SPARQR for coarse-grained parallel computations is described. The coefficient matrix, which is assumed to be general sparse, is reordered in an attempt to bring as many zero elements in the lower left corner as possible. The reordered matrix is then partitioned in