Divide-and-conquer eigenvalue algorithm

Known as: Divide 
Divide-and-conquer eigenvalue algorithms are a class of eigenvalue algorithms for Hermitian or real symmetric matrices that have recently (circa… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2004-2013
01220042013

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
In this paper, aiming at solving the bidiagonal SVD problem, a classical divide-andconquer (DC) algorithm is modified, which… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
  • table 4
Is this relevant?
2013
2013
The circle and rectangle orthogonal packing problem with equilibrium constraints (ECROPP) belongs to NP-hard problems. This paper… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • table 3
Is this relevant?
2012
2012
The use of resonant CMOS frequency dividers with direct injection in frequency synthesizers has increased in recent years due to… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2012
2012
AB2410 To a large extent, buildings consist of repetitions of identical or sufficiently similar elements. In its previous… (More)
Is this relevant?
2011
2011
Self-optimizing mechatronic systems are a new class of technical system promising new levels of flexibility and utility in… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
2008
2008
In this paper, a new approach for improving the performance of recognition system is proposed. The main idea of proposed approach… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2005
2005
A hybrid heuristic algorithm for the two-dimensional rectangular packing problem is presented. This algorithm is mainly based on… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 7
  • figure 8
Is this relevant?
2004
2004
It is commonplace to say that central control of large complex entities is doomed to fail. We have numerous examples from… (More)
Is this relevant?
2004
2004
Summary form only given. A hybrid divide and conquer algorithm is one that switches from a divide and conquer to an iterative… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?