Simultaneous Diagonalization of Various Size Matrices

Takanori MAEHARA
February 2015
AIP Conference Proceedings;2015, Vol. 1648 Issue 1, p1
Conference Proceeding
The simultaneous diagonalization problem of various size matrices is considered. We propose an algorithm for the problem that always finds a solution if one exists. The algorithm uses an algorithm for the simultaneous diagonalization of square matrices as a subroutine.


Related Articles

  • Approach to optimization of part machining service combination. Sun, Huibin; Wan, Neng; Chang, Zhiyong; Mo, Rong // International Journal of Advanced Manufacturing Technology;Sep2011, Vol. 56 Issue 5-8, p767 

    To find out the best part machining service provider combination, the theory of multiple objective optimization is discussed in detail via mathematic formulation. Relationships among service provider candidates, service types and parameters are analyzed and uncovered by matrix accumulation. The...

  • 1843. Dynamic response of underground box-type structure to explosion seismic waves. Peng-xian Fan; Ming-yang Wang; Cheng Chu; Hai-yang Ma // Journal of Vibroengineering;Dec2015, Vol. 17 Issue 8, p4354 

    The dynamic response of lined tunnels with a uniform box-type cross-section buried into elastic half-space to explosion seismic waves is studied by employing the matrix force method and treating the structure as a connecting rod system interacting with foundation. The main equations for dynamic...

  • BOOSTING THE PERFORMANCE OF METAHEURISTICS FOR THE MINLA PROBLEM USING A MORE DISCRIMINATING EVALUATION FUNCTION. Rodriguez-Tello, Eduardo; Jin-Kao Hao; Romero-Monsivais, Hillel // Tehnicki vjesnik / Technical Gazette;Jan/Feb2015, Vol. 22 Issue 1, p11 

    This paper investigates the role of evaluation function used by metaheuristics for solving combinatorial optimization problems. Evaluation function (EF) is a key component of any metaheuristic algorithm and its design directly influences the performance of such an algorithm. However, the design...

  • A Greedy Heuristic Algorithm for Solving the Capacitated Planar Multi-facility Location-Allocation Problem. Luis, Martino; Ramli, Mohammad Fadzli; Lin, Abdullah // AIP Conference Proceedings;2016, Vol. 1782 Issue 1, p1 

    This study investigates the capacitated planar multi-facility location-allocation problem by considering various capacity constraints. The problem is also known as the capacitated multi-source Weber problem, where the number of facilities to be located is specified and each of which has a...

  • To solving problems of algebra for two-parameter matrices. II. Kublanovskaya, V. // Journal of Mathematical Sciences;Mar2009, Vol. 157 Issue 5, p753 

    This paper is one of the series of survey papers dedicated to the development of methods for solving problems of algebra for two-parameter polynomial matrices of general form. The paper considers the AB-algorithm and the ?V-2 factorization algorithm, together with their applications....

  • To solving problems of algebra for two-parameter matrices. III. Kublanovskaya, V.; Khazanov, V. // Journal of Mathematical Sciences;Mar2009, Vol. 157 Issue 5, p761 

    The paper continues the series of papers devoted to surveying and developing methods for solving algebraic problems for two-parameter polynomial and rational matrices of general form. It considers linearization methods, which allow one to reduce the problem of solving an equation F(?, �)x =...

  • Improved Particle Swarm Optimizer with Dynamically Adjusted Search Space and Velocity Limits for Global Optimization. Adewumi, Aderemi Oluyinka; Arasomwan, Akugbe Martins // International Journal on Artificial Intelligence Tools;Oct2015, Vol. 24 Issue 5, p-1 

    This paper presents an improved particle swarm optimization (PSO) technique for global optimization. Many variants of the technique have been proposed in literature. However, two major things characterize many of these variants namely, static search space and velocity limits, which bound their...

  • Simple ingredients leading to very efficient heuristics for the maximum clique problem. Grosso, Andrea; Locatelli, Marco; Pullan, Wayne // Journal of Heuristics;Nov2008, Vol. 14 Issue 6, p587 

    Starting from an algorithm recently proposed by Pullan and Hoos, we formulate and analyze iterated local search algorithms for the maximum clique problem. The basic components of such algorithms are a fast neighbourhood search (not based on node evaluation but on completely random selection) and...

  • Unbalanced Graph Partitioning. Li, Angsheng; Zhang, Peng // Theory of Computing Systems;Oct2013, Vol. 53 Issue 3, p454 

    We investigate the unbalanced cut problems. A cut ( A, B) is called unbalanced if the size of its smaller side is at most k (called k-size) or exactly k (called E k-size), where k is an input parameter. We consider two closely related unbalanced cut problems, in which the quality of a cut is...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics