The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
The Singular Value Decomposition: Computation and Applications to Robotics
Open accessAbstract
The singular value decomposition has been extensively used for the analysis of the kinematic and dynamic characteristics of robotic manipulators. Due to a reputation for being nu merically expensive to compute, however, it has not been used for real-time applications. This work illustrates a for mulation for the singular value decomposition that takes advantage of the nature of robotics matrix calculations to ob tain a computationally feasible algorithm. Several applica tions, including the control of redundant manipulators and the optimization of dexterity, are discussed. A detailed illus tration of the use of the singular value decomposition to deal with the general problem of singularities is also presented.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Solving Least Squares Problems
Lawson, C. L., & Hanson, R. J. (1995) · doi:10.1137/1.9781611971217 · Cited by 7,103
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929
Wampler, C. (1986) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1986.289285 · Cited by 850 · cited 1×
“…general approach to resolving the discontinuity at singular configurations and maintaining a well-conditioned formulation that results in physically meaningful joint velocities is to use the damped least-squares formulation independently proposed in Naka-mura and Hanafusa (1986) and Wampler (1986).”
MethodAlgorithm 358: singular value decomposition of a complex matrix [F1, 4, 5]
Businger, P. A., & Golub, G. H. (1969) · Communications of the ACM · doi:10.1145/363235.363249 · Cited by 143 · cited 1×
“The Golub-Reinsch Algorithm The most popular technique for computing the SVD was first proposed in Golub and Kahan (1965) with source code published in Businger and Golub (1969).”
Method
Cited by
Robot Grasp Synthesis Algorithms: A Survey
Shimoga, K. B. (1996) · The International Journal of Robotics Research · doi:10.1177/027836499601500302 · Cited by 666
Chiaverini, S., Siciliano, B., & Egeland, O. (1994) · IEEE Transactions on Control Systems Technology · doi:10.1109/87.294335 · Cited by 308
Metadata
- Authors
- Maciejewski, A. A., & Klein, C. A.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 1989-12
- Volume
- 8
- Issue
- 6
- Pages
- 63-79
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2045410079
- Cited by
- 198
- References
- 4
- FWCI
- 8.89
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Singular Value Decomposition: Computation and Applications to Robotics. https://app.cochat.ai/papers/10.1177/027836498900800605
- The paper
- Maciejewski, A. A., & Klein, C. A. (1989). The Singular Value Decomposition: Computation and Applications to Robotics. The International Journal of Robotics Research. https://doi.org/10.1177/027836498900800605
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.