An application of preconditioned conjugate gradients to relative placement in chip design
Zitieren Sie bitte immer diese URN: urn:nbn:de:bvb:20-opus-31996
- In distance geometry problems and many other applications, we are faced with the optimization of high-dimensional quadratic functions subject to linear equality constraints. A new approach is presented that projects the constraints, preserving sparsity properties of the original quadratic form such that well-known preconditioning techniques for the conjugate gradient method remain applicable. Very-largescale cell placement problems in chip design have been solved successfully with diagonal and incomplete Cholesky preconditioning. NumericalIn distance geometry problems and many other applications, we are faced with the optimization of high-dimensional quadratic functions subject to linear equality constraints. A new approach is presented that projects the constraints, preserving sparsity properties of the original quadratic form such that well-known preconditioning techniques for the conjugate gradient method remain applicable. Very-largescale cell placement problems in chip design have been solved successfully with diagonal and incomplete Cholesky preconditioning. Numerical results produced by a FORTRAN 77 program illustrate the good behaviour of the algorithm.…
Autor(en): | Christian Kredler, Christian Zillober, Frank Johannes, Georg Sigl |
---|---|
URN: | urn:nbn:de:bvb:20-opus-31996 |
Dokumentart: | Artikel / Aufsatz in einer Zeitschrift |
Institute der Universität: | Fakultät für Mathematik und Informatik / Institut für Mathematik |
Sprache der Veröffentlichung: | Englisch |
Erscheinungsjahr: | 1993 |
Originalveröffentlichung / Quelle: | In: International Journal for Numerical Methods in Engineering (1993) 36, 255-271. |
Allgemeine fachliche Zuordnung (DDC-Klassifikation): | 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik |
Datum der Freischaltung: | 18.12.2008 |