Results 211 to 220 of about 3,814,069 (243)

Diagonalization of diffusion matrix in Grover's algorithm

Physics Letters A, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kwek, L.C., Oh, C.H., Singh, K., Wang, X.-B.   +3 more
openaire   +2 more sources

An algorithm for approximately diagonalizing a matrix

Proceedings of the IEEE, 1969
An algorithm is presented for selecting a sequence of similarity transformations which successively reduce the norm of the difference between the transformed matrix and a desired form. The algorithm is useful in reducing the cost of simulating the transient response of linear, time-invariant, dynamical systems on the digital computer and can be used to
openaire   +1 more source

On the robustness of LMS algorithms with time-variant diagonal matrix step-size

2013 IEEE International Conference on Acoustics, Speech and Signal Processing, 2013
The Proportionate Normalized Least Mean Squares (PNLMS) algorithm has been quite successful in combining higher convergence rates with low to moderate complexity that at the same time avoids numerical difficulties in fixed-point implementations. While the algorithm is stable in the mean square and l2-sense for time-invariant matrices, the treatment of ...
Robert Dallinger, Markus Rupp
openaire   +1 more source

An algebraic algorithm for the diagonalization of a biquaternion matrix in the biquaternionic mechanics

Computational and Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dong Zhang, Tongsong Jiang, Zhenwei Guo, V. I. Vasil'ev   +3 more
openaire   +1 more source

Pivotal-condensation algorithms for a (2m + 1)-diagonal matrix

USSR Computational Mathematics and Mathematical Physics, 1984
Consider a system of linear algebraic equations \[ (1)\quad \sum^{j_ 1}_{j=-j_ 2}A_{ij}x_{i+j}=y_ i,\quad i=1,...,n, \] where ...
openaire   +1 more source

An adaptive stochastic approximation algorithm for simultaneous diagonalization of matrix sequences with applications

IEEE Transactions on Pattern Analysis and Machine Intelligence, 1997
We describe an adaptive algorithm based on stochastic approximation theory for the simultaneous diagonalization of the expectations of two random matrix sequences. Although there are several conventional approaches to solving this problem, there are many applications in pattern analysis and signal detection that require an online (i.e., real-time ...
Chanchal Chatterjee, Vwani P. Roychowdhury   +1 more
openaire   +1 more source

An Algorithm for Finding an Optimal Projection of a Symmetric Matrix onto a Diagonal Matrix

SIAM Journal on Matrix Analysis and Applications, 2014
This work is motivated by two two-sided optimization problems that arise in atomic chemistry when one is looking for a minimal set of localized orbitals with prescribed occupation numbers, respectively, a prescribed total number of electrons. We first propose an optimal analytic solution of the first problem, and then show that an optimal solution of ...
openaire   +2 more sources

New blind beamforming algorithm using joint multiple matrix diagonalization

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005., 2005
We propose a new joint multiple matrix diagonalization algorithm for robust blind beamforming. This new algorithm is based on the iterative eigen-decomposition of cumulant matrices. Therefore it can avoid the stability and misadjustment problems arising among the conventional steepest-descent approaches for constant-modulus or cumulant optimization ...
Hsiao-Chun Wu, Xiaozhou Huang
openaire   +1 more source

An algorithm of non-conflict schedule with joint diagonals activation of connectivity matrix

Proceedings of the 13th International Conference on Computer Systems and Technologies, 2012
A synthesis of an algorithm for non-conflict schedule with joint diagonals activation is done. A software model of the algorithm is built. Rapidity, performance and memory resources are analyzed. It is calculated the performance and memory resource for different switching matrix types and sizes.
Kiril Kolchakov, Tasho D. Tashev
openaire   +2 more sources

EFFICIENT SEMI-IMPLICIT SOLVING ALGORITHM FOR NINE-DIAGONAL COEFFICIENT MATRIX

Numerical Heat Transfer, 1987
In numerical calculations of fluid flows and heat transfer it is often necessary to solve a system of algebraic equations with a nine-diagonal coefficient matrix. Two examples are the diffusion and pressure- correction equations when discretized on nonorthogonal grids.
openaire   +1 more source