Fixed-point iterative procedures for solving nonlinear parameter dependent problems can converge for some interval of parameter values and diverge as the parameter changes. The Recursive Projection Method (RPM), which stabilizes such procedures by computing a projection onto the unstable subspace is presented. On this subspace a Newton or special Newton iteration is performed, and the fixed-poi...

In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.

We adapt Schaback’s error doubling trick [13] to give error estimates for radial interpolation of functions with smoothness lying (in some sense) between that of the usual native space and the subspace with double the smoothness. We do this for both bounded subsets of IR and spheres. As a step on the way to our ultimate goal we also show convergence of pseudo-derivatives of the interpolation er...

In this paper, we study the Bauer-Fike type theorems for regular matrix pairs and its general form. Besides these, we also obtain some bounds for measuring approximate generalized eigenvalues and for the perturbation of generalized eigenvalues concerning an approximate generalized invariant subspace. To estimate all these bounds, p-Hölder norm and an ad hoc pseudo-metric called p-Chordal matric...

We consider a positive measure on [0,∞) and a sequence of nested spaces L0 ⊂ L1 ⊂ L2 · · · of rational functions with prescribed poles in [−∞, 0]. Let {φk}k=0, with φ0 ∈ L0 and φk ∈ Lk \ Lk−1, k = 1, 2, . . . be the associated sequence of orthogonal rational functions. The zeros of φn can be used as the nodes of a rational Gauss quadrature formula that is exact for all functions in Ln · Ln−1, a...

Last decades have witnessed a number of studies devoted to multi-view learning algorithms, however, few efforts have been made to handle online multi-view learning scenarios. In this paper, we propose an online Bayesian multi-view learning algorithm to learn predictive subspace with max-margin principle. Specifically, we first define the latent margin loss for classification in the subspace, an...

This paper presents the performance analysis of directions of arrival estimation techniques, Subspace and the Non-Subspace methods. In this paper, exploring the Eigen-analysis category of high resolution and super resolution algorithms, presentation of description, comparison and the performance and resolution analyses of these algorithms are made. Sensitivity to various perturbations and the e...

This paper presents a data driven solution of the Fault Identification approach Connected to Subspace Identification (FICSI) for Linear Parameter Varying (LPV) systems. The proposed solution links system identification to fault detection and estimation in affine LPV systems. As an extension of the model-based FICSI-LPV, the data driven solution is also formulated based on the affine LPV model s...