AbstractThe existing iterative algorithms for optimal orthonormalization of the strapdown matrix are reviewed. In order to ensure convergence these algorithms all have restrictions in the initial direction cosine matrix. Another algorithm, the singular vector algorithm, is proposed. This algorithm is based on the singular value decomposition of a matrix. Convergence of the algorithm is established. The advantages of the algorithm are investigated by comparing its convergence, accuracy and computational demands with other algorithms. The algorithm is illustrated with numerical examples
We consider orthonormal expansions where the basis functions are governed by some free parameters. I...
An investigation is made of a hybrid method inspired by Riccati transformations and marching algorit...
AbstractA nonlinear conjugate gradient method has been introduced and analyzed by J.W. Daniel. This ...
AbstractThe existing iterative algorithms for optimal orthonormalization of the strapdown matrix are...
Abstract. The symmetric orthogonalization, which is obtained from the polar decomposition of a matri...
Certain applications produce initial value ODEs whose solutions, regarded as time-dependent matrices...
Abstract, Conjugate Gradient-like methods such as Orthomin(k) have been developed to obtain a good n...
In the present paper the ORTHOMAX rotation problem is reconsidered. It is shown that its solution ca...
A novel technique for selecting the poles of orthonormal basis functions (OBF) in Volterra models of...
A novel technique for selecting the poles of orthonormal basis functions (OBF) in Volterra models of...
Based on analyzing the properties of Bernstein polynomials, the extended orthonormal Bernstein polyn...
Various methods of constructing an orthonomal set out of a given set of linearly independent vectors...
AbstractWe present a new O(n3) algorithm for computing the SVD of an n×n polynomial Vandermonde matr...
Introduction. The di#culties with the simple shooting method for the solution of ordinary di#erenti...
Optimization problems with orthogonality constraints have many applications in science and engineeri...
We consider orthonormal expansions where the basis functions are governed by some free parameters. I...
An investigation is made of a hybrid method inspired by Riccati transformations and marching algorit...
AbstractA nonlinear conjugate gradient method has been introduced and analyzed by J.W. Daniel. This ...
AbstractThe existing iterative algorithms for optimal orthonormalization of the strapdown matrix are...
Abstract. The symmetric orthogonalization, which is obtained from the polar decomposition of a matri...
Certain applications produce initial value ODEs whose solutions, regarded as time-dependent matrices...
Abstract, Conjugate Gradient-like methods such as Orthomin(k) have been developed to obtain a good n...
In the present paper the ORTHOMAX rotation problem is reconsidered. It is shown that its solution ca...
A novel technique for selecting the poles of orthonormal basis functions (OBF) in Volterra models of...
A novel technique for selecting the poles of orthonormal basis functions (OBF) in Volterra models of...
Based on analyzing the properties of Bernstein polynomials, the extended orthonormal Bernstein polyn...
Various methods of constructing an orthonomal set out of a given set of linearly independent vectors...
AbstractWe present a new O(n3) algorithm for computing the SVD of an n×n polynomial Vandermonde matr...
Introduction. The di#culties with the simple shooting method for the solution of ordinary di#erenti...
Optimization problems with orthogonality constraints have many applications in science and engineeri...
We consider orthonormal expansions where the basis functions are governed by some free parameters. I...
An investigation is made of a hybrid method inspired by Riccati transformations and marching algorit...
AbstractA nonlinear conjugate gradient method has been introduced and analyzed by J.W. Daniel. This ...