Abstract
The problem tackled in this paper is the parallel construction of a unit triangular matrix with prescribed singular values, when these fulfill Weyl’s conditions [9] ; this is a particular case of the Inverse Singular Value Problem. A sequential algorithm for this problem was proposed in [10] by Kosowsky and Smoktunowicz. In this paper parallel versions of this algorithm will be described, both for shared memory and distributed memory architectures. The proposed parallel implementation is better suited for the shared memory paradigm; this is confirmed by the numerical experiments; the shared memory version, reaches an efficiency over 90%, and reduces substantially the execution times compared with the sequential algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anderson, E., et al.: LAPACK User Guide, 2nd edn. SIAM, Philadelphia (1995)
Chandra, R., et al.: Parallel Programming in OpenMP. Morgan Kaufmann, San Francisco (2001)
Chu, M.T.: Inverse Eigenvalue Problems. SIAM Review 40 (1998)
Dongarra, J., Van de Geijn, R.: Two dimensional basic linear algebra comunications subprograms. Technical report st–cs–91–138, Department of Computer Science, University of Tennessee (1991)
Flores-Becerra, G., García, V.M., Vidal, A.M.: Numerical Experiments on the Solution of the Inverse Additive Singular Value Problem. In: Sunderam, V.S., et al. (eds.) ICCS 2005. LNCS, vol. 3514, pp. 17–24. Springer, Heidelberg (2005)
Groetsch, C.W.: Inverse Problems. Activities for Undergraduates. The mathematical association of America (1999)
Groupp, W., Lusk, E., Skjellum, A.: Using MPI: Portable Parallel Programming with Message Passing Interface. MIT Press, Cambridge (1994)
Hammarling, S., et al.: An extended set of fortran basic linear algebra subroutines. ACM Trans. Mathemathical Software (1988)
Horn, A.: On the eigenvalues of a matrix with prescribed singular values. Proc. Amer. Math. Soc. 5, 4–7 (1954)
Kosowski, P., Smoktunowicz, A.: On Constructing Unit Triangular Matrices with Prescribed Singular Values. Computing 64(3), 279–285 (2000)
Neittaanmäi, P., Rudnicki, M., Savini, A.: Inverse Problems and Optimal Design in Electricity and Magnetism. Clarendon Press, Oxford (1996)
Sun, N.: Inverse Problems in Groundwater Modeling. Kluwer Academic Publishers, Dordrecht (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Flores-Becerra, G., Garcia, V.M., Vidal, A.M. (2007). Efficient Parallel Algorithm for Constructing a Unit Triangular Matrix with Prescribed Singular Values. In: Daydé, M., Palma, J.M.L.M., Coutinho, Á.L.G.A., Pacitti, E., Lopes, J.C. (eds) High Performance Computing for Computational Science - VECPAR 2006. VECPAR 2006. Lecture Notes in Computer Science, vol 4395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71351-7_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-71351-7_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71350-0
Online ISBN: 978-3-540-71351-7
eBook Packages: Computer ScienceComputer Science (R0)