ACM Transactions on Mathematical Software
Công bố khoa học tiêu biểu
Sắp xếp:
Piecewise Quadratic Approximations on Triangles
ACM Transactions on Mathematical Software - Tập 3 Số 4 - Trang 316-325 - 1977
Algorithm 778: L-BFGS-B L-BFGS-B is a limited-memory algorithm for solving large nonlinear optimization problems subject to simple bounds on the variables. It is intended for problems in which information on the Hessian matrix is difficult to obtain, or for large dense problems. L-BFGS-B can also be used for unconstrained problems and in this case performs similarly to its predessor, algorithm L-BFGS (Harwell routine VA15). The algorithm is implemented in Fortran 77.
ACM Transactions on Mathematical Software - Tập 23 Số 4 - Trang 550-560 - 1997
SBA Bundle adjustment constitutes a large, nonlinear least-squares problem that is often solved as the last step of feature-based structure and motion estimation computer vision algorithms to obtain optimal estimates. Due to the very large number of parameters involved, a general purpose least-squares algorithm incurs high computational and memory storage costs when applied to bundle adjustment. Fortunately, the lack of interaction among certain subgroups of parameters results in the corresponding Jacobian being sparse, a fact that can be exploited to achieve considerable computational savings. This article presents sba, a publicly available C/C++ software package for realizing generic bundle adjustment with high efficiency and flexibility regarding parameterization.
ACM Transactions on Mathematical Software - Tập 36 Số 1 - Trang 1-30 - 2009
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software - Tập 3 Số 3 - Trang 209-226 - 1977
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software - Tập 6 Số 4 - Trang 563-580 - 1980
Algorithm 795 Polynomial systems occur in a wide variety of application domains. Homotopy continuation methods are reliable and powerful methods to compute numerically approximations to all isolated complex solutions. During the last decade considerable progress has been accomplished on exploiting structure in a polynomial system, in particular its sparsity. In this article the structure and design of the software package PHC is described. The main program operates in several modes, is menu driven, and is file oriented. This package features great variety of root-counting methods among its tools. The outline of one black-box solver is sketched, and a report is given on its performance on a large database of test problems. The software has been developed on four different machine architectures. Its portability is ensured by the gnu-ada compiler.
ACM Transactions on Mathematical Software - Tập 25 Số 2 - Trang 251-276 - 1999
An Adaptive Nonlinear Least-Squares Algorithm
ACM Transactions on Mathematical Software - Tập 7 Số 3 - Trang 348-368 - 1981
A set of level 3 basic linear algebra subprograms This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrix-vector operations that should provide for efficient and portable implementations of algorithms for high-performance computers
ACM Transactions on Mathematical Software - Tập 16 Số 1 - Trang 1-17 - 1990
An extended set of FORTRAN basic linear algebra subprograms This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrix-vector operations that should provide for efficient and portable implementations of algorithms for high-performance computers.
ACM Transactions on Mathematical Software - Tập 14 Số 1 - Trang 1-17 - 1988
Algorithm 807 We present a software toolbox for symmetric band reduction via orthogonal transformations, together with a testing and timing program. The toolbox contains drivers and computational routines for the reduction of full symmetric matrices to banded form and the reduction of banded matrices to narrower banded or tridiagonal form, with optional accumulation of the orthogonal transformations, as well as repacking routines for storage rearrangement. The functionality and the calling sequences of the routines are described, with a detailed discussion of the “control” parameters that allow adaptation of the codes to particular machine and matrix characteristics. We also briefly describe the testing and timing program included in the toolbox.
ACM Transactions on Mathematical Software - Tập 26 Số 4 - Trang 602-616 - 2000
Tổng số: 14
- 1
- 2