• No results found

Best approximation and the Grassmann Matrix

Optimization algorithms on the Grassmann manifold with application to matrix eigenvalue problems

Optimization algorithms on the Grassmann manifold with application to matrix eigenvalue problems

... the Grassmann manifold is shown to be expressed as a Lyapunov equation, and can be solved by applying an existing ...symmetric matrix characteristic of the Rayleigh quotient cost function has a degenerate ...

43

A Grassmann Matrix Approach for the Computation of Degenerate Solutions for Output Feedback Laws

A Grassmann Matrix Approach for the Computation of Degenerate Solutions for Output Feedback Laws

... the Grassmann variety of P ...the Grassmann Matrices and the first order conditions for optimality are reduced to a nonlinear eigenvalue-eigenvector ...

7

Best Approximation in TVS

Best Approximation in TVS

... In this paper we give new results on the best approxi- mation in the Hausdorff topological vector space and consider rela- tionship with orthogonality.. Introduction and Prelimiaries.[r] ...

5

ON THE BEST APPROXIMATION OF THE DIFFERENTIATION OPERATOR

ON THE BEST APPROXIMATION OF THE DIFFERENTIATION OPERATOR

... the best approximation in the uniform norm of the differentiation operator of order k by bounded linear operators in the class of functions with the property that the Fourier transforms of their derivatives ...

10

Best L1-approximation with splines

Best L1-approximation with splines

... discussed best L 1 -approximation for both the continu- ous case and the discrete ...the best L 1 -approximation in the continuous ...the best L 1 ...1 approximation that is ...

58

Best Approximation and Moduli of Smoothness

Best Approximation and Moduli of Smoothness

... BEST APPROXIMATION AND MODULI OF SMOOTHNESS Teodora Dimova Zapryanova Dedicated to the 65 years Aniversary of Professor Petar Popivanov ...of approximation for characterization of the best ...

9

Continuous Matrix Approximation on Distributed Data

Continuous Matrix Approximation on Distributed Data

... |kAxk 2 − kBxk 2 | ≤ εkAk 2 F for any unit vector x. Given the above connection, in this paper, first we pro- pose four novel methods for tracking weighted heavy hitters in a distributed stream of items (note that ...

12

Sumit Chandok and T. D. Narang INVARIANT POINTS OF BEST APPROXIMATION AND BEST SIMULTANEOUS APPROXIMATION

Sumit Chandok and T. D. Narang INVARIANT POINTS OF BEST APPROXIMATION AND BEST SIMULTANEOUS APPROXIMATION

... of best ap- proximation to the set of best simultaneous approximation, which is not necessarily ...on best approximation are ...

10

1.Best approximation of functions of generalized Zygmund class by matrix-Euler summability means of Fourier series

1.Best approximation of functions of generalized Zygmund class by matrix-Euler summability means of Fourier series

... Best approximation, Fourier series, ( E, 1) means, matrix summability means and (∆ .E1 )- summability means, generalized Minkowski’s inequality, generalized Zygmund class.. 2013 Universi[r] ...

13

Towards More Efficient SPSD Matrix Approximation and CUR Matrix Decomposition

Towards More Efficient SPSD Matrix Approximation and CUR Matrix Decomposition

... (SPSD) matrix approximation methods have been extensively used to speed up large-scale eigenvalue computation and kernel learning ...SPSD matrix approximation ...the matrix size n to ...

49

Best Approximation in Uniformity Type Spaces

Best Approximation in Uniformity Type Spaces

... University of Jordan, Department of mathematics, Amman-Jordan Abstract. Let X be a set, and Γ be a collection of subsets of X × X . The object of this paper, is to define a semi-linear uniform space by assuming certain ...

8

Extensions of best approximation and coincidence theorems

Extensions of best approximation and coincidence theorems

... On the other hand, recently there have appeared some best approximation or fixed point theorems for maps whose domains and ranges have different topologies for example, see [9-17].. More[r] ...

10

APPROXIMATION TO THE COVARIANCE MATRIX FOR STOCHASTIC POINT KINETICS

APPROXIMATION TO THE COVARIANCE MATRIX FOR STOCHASTIC POINT KINETICS

... precursors, time steps, Brownian motion and initial conditions. The results obtained by the numerical experiments are compared on mean with the deterministic model (DM) of the point kinetics which is calculated by the ...

8

Lower bounds for the low rank matrix approximation

Lower bounds for the low rank matrix approximation

... low-rank matrix approximation ...low-rank matrix approximation ...low-rank approximation, when a perturbation E exists, there is an approximation error which cannot be avoided, ...

14

Generalized Reich-Moore R-matrix approximation

Generalized Reich-Moore R-matrix approximation

... GRMA matrix elements Empirical fitting of Reich-Moore capture widths to neutron capture and cross section data using conventional Reich-Moore approximation often reveals variations among RMA capture ...

5

Algorithms for the Rational Approximation of Matrix-Valued Functions

Algorithms for the Rational Approximation of Matrix-Valued Functions

... of matrix-valued inter- ...with matrix-valued ...Loewner matrix), and to somehow restrict the search for the next interpolation point to a smaller ...

21

Fast Approximation of Matrix Coherence and Statistical Leverage

Fast Approximation of Matrix Coherence and Statistical Leverage

... tall matrix,” and they concluded that their empir- ical results “suggest that random projection algorithms should be incorporated into future versions of L APACK ” (Avron et ...

32

LLORMA: Local Low-Rank Matrix Approximation

LLORMA: Local Low-Rank Matrix Approximation

... probabilistic matrix factorization (PMF) and later Salakhutdinov and Mnih (2008b) extended matrix factorization to fully Bayesian ap- ...in matrix completion were demonstrated in Toh and Yun (2010); ...

24

Grassmann Learning for Recognition and  Classification

Grassmann Learning for Recognition and Classification

... The Grassmann based algorithms are much better at classifying actions and recognizing faces than the non-Grassmann algorithms, with GRASP and GSR performing at or near the top for the single and all ...All ...

132

Best approximation of functions in generalized Hölder class

Best approximation of functions in generalized Hölder class

... Several results on the error estimation of a function g in Lipschitz and Hölder classes by a trigonometric polynomial using different single and product means have been obtained by the researchers like [1–11], and [12]. ...

15

Show all 10000 documents...

Related subjects