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

Subspace Projection for Multivariate Selection Problems

โœ Scribed by W.J. Krzanowski

Publisher
Springer
Year
1998
Tongue
English
Weight
571 KB
Volume
15
Category
Article
ISSN
0176-4268

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Krylov subspace projection method for
A Krylov subspace projection method for simultaneous solution of Helmholtz problems at multiple frequencies
โœ Marcus M. Wagner; Peter M. Pinsky; Assad A. Oberai; Manish Malhotra ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 563 KB

A Krylov subspace projection method which provides simultaneous solutions of the Helmholtz equation at multiple frequencies in one solution step is presented. The projector is obtained with an unsymmetric block Lanczos algorithm applied to a transfer function derived from a finite element discretiza

Subspace iterative methods for eigenvalu
Subspace iterative methods for eigenvalue problems
โœ T. Zhang; G.H. Golub; K. H. Law ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 169 KB

This paper presents novel perturbation bounds for generalized symmetric positive deยฎnite eigenvalue problems. The bounds provide the insights for an observed computational phenomenon that is not easily explained by the existing bounds developed previously. Using the new bounds, we provide an analysi

An improved subspace selection algorithm
An improved subspace selection algorithm for meshless collocation methods
โœ Leevan Ling; Robert Schaback ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 536 KB

## Abstract Choosing data points is a common problem for researchers who employ various meshless methods for solving partial differential equations. On the one hand, high accuracy is always desired; on the other, illโ€conditioning problems of the resultant matrices, which may lead to unstable algori