16 September 1980 Solution Of Block-Structured Least-Squares Problems
Author Affiliations +
Proceedings Volume 0237, 1980 International Lens Design Conference; (1980) https://doi.org/10.1117/12.959074
Event: 1980 International Lens Design Conference, 1980, Oakland, United States
Abstract
The design of multi-configuration optical systems leads to the minimization of a merit function whose terms are most conveniently evaluated in groups. The Jacobian or difference matrix associated with these merit functions can be decomposed into blocks corresponding to these groups. The associated constrained least-squares problem can be solved without requiring that more than two or three blocks be in high-speed memory at one time. The algorithm described here is useful for lens-design programs running on mini-computers where high-speed memory is limited but medium-speed storage such as disc is available. An orthogonal factorization of the matrix is obtained so that rank-deficient problems can be handled in a consistent and numerically stable manner. This factorization can be used as an adjunct to a variety of least-squares type algorithms.
© (1980) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Charles R. Crawford, "Solution Of Block-Structured Least-Squares Problems", Proc. SPIE 0237, 1980 International Lens Design Conference, (16 September 1980); doi: 10.1117/12.959074; https://doi.org/10.1117/12.959074
PROCEEDINGS
4 PAGES


SHARE
RELATED CONTENT

A study of optical design of zoom optics
Proceedings of SPIE (September 25 2013)
Design Of Orthoprojector Optics
Proceedings of SPIE (February 14 1986)
A Sophisticated Optical Design Program For Microcomputers
Proceedings of SPIE (October 26 1983)
Modeling of diffractive optical elements for lens design
Proceedings of SPIE (November 25 1993)
Generalized method for first-order lens layout
Proceedings of SPIE (September 27 1999)

Back to Top