SIAM Journal on Matrix Analysis and Applications http://scitation.aip.org/ SIAM Journal on Matrix Analysis and Applications Block Tensor Unfoldings http://link.aip.org/link/?SML/33/149/1&agg=rss Stefan Ragnarsson and Charles F. Van Loan<br/> Within the field of numerical multilinear algebra, block tensors are increasingly important. Accordingly, it is appropriate to develop an infrastructure that supports reasoning about block tensor computation. In this paper we establish concise notation that is suitable for the analysis and developm ... [SIAM. J. Matrix Anal. & Appl. 33, 149 (2012)] published Fri Jan 13, 2012. Verified Bounds for Least Squares Problems and Underdetermined Linear Systems http://link.aip.org/link/?SML/33/130/1&agg=rss Siegfried M. Rump<br/> New algorithms are presented for computing verified error bounds for least squares problems and underdetermined linear systems. In contrast to previous approaches the new methods do not rely on normal equations and are applicable to sparse matrices. Computational results demonstrate that the new me ... [SIAM. J. Matrix Anal. & Appl. 33, 130 (2012)] published Fri Jan 13, 2012. Uni-mode and Partial Uniqueness Conditions for CANDECOMP/PARAFAC of Three-Way Arrays with Linearly Dependent Loadings http://link.aip.org/link/?SML/33/111/1&agg=rss Xijing Guo, Sebastian Miron, David Brie, and Alwin Stegeman<br/> In this paper, three sufficient conditions are derived for the three-way CANDECOMP/PARAFAC (CP) model, which ensure uniqueness in one of the three modes (uni-mode-uniqueness). Based on these conditions, a partial uniqueness condition is proposed which allows collinear loadings in only one mode. We ... [SIAM. J. Matrix Anal. & Appl. 33, 111 (2012)] published Fri Jan 13, 2012. On Iterative Solution for Linear Complementarity Problem with an $H_{+}$-Matrix http://link.aip.org/link/?SML/33/97/1&agg=rss A. Hadjidimos, M. Lapidakis, and M. Tzoumas<br/> The numerous applications of the linear complementarity problem (LCP) in, e.g., the solution of linear and convex quadratic programming, free boundary value problems of fluid mechanics, and moving boundary value problems of economics make its efficient numerical solution a very imperative and inter ... [SIAM. J. Matrix Anal. & Appl. 33, 97 (2012)] published Tue Jan 10, 2012. Compact Fourier Analysis for Multigrid Methods based on Block Symbols http://link.aip.org/link/?SML/33/73/1&agg=rss Thomas K. Huckle and Christos Kravvaritis<br/> The notion of compact Fourier analysis (CFA) is discussed. CFA allows description of multigrid (MG) in a nutshell and offers a clear overview on all MG components. The principal idea of CFA is to model the MG mechanisms by means of scalar generating functions and matrix functions (block symbols). T ... [SIAM. J. Matrix Anal. & Appl. 33, 73 (2012)] published Thu Jan 5, 2012. Difference Filter Preconditioning for Large Covariance Matrices http://link.aip.org/link/?SML/33/52/1&agg=rss Michael L. Stein, Jie Chen, and Mihai Anitescu<br/> In many statistical applications one must solve linear systems involving large, dense, and possibly irregularly structured covariance matrices. These matrices are often ill-conditioned; for example, the condition number increases at least linearly with respect to the size of the matrix when observa ... [SIAM. J. Matrix Anal. & Appl. 33, 52 (2012)] published Thu Jan 5, 2012. dqds with Aggressive Early Deflation http://link.aip.org/link/?SML/33/22/1&agg=rss Yuji Nakatsukasa, Kensuke Aishima, and Ichitaro Yamazaki<br/> The dqds algorithm computes all the singular values of an $n \times n$ bidiagonal matrix to high relative accuracy in $O(n^2)$ cost. Its efficient implementation is now available as a LAPACK subroutine and is the preferred algorithm for this purpose. In this paper we incorporate into dqds a techniq ... [SIAM. J. Matrix Anal. & Appl. 33, 22 (2012)] published Thu Jan 5, 2012. Stable Computation of the CS Decomposition: Simultaneous Bidiagonalization http://link.aip.org/link/?SML/33/1/1&agg=rss Brian D. Sutton<br/> Since its discovery in 1977, the CS decomposition (CSD) has resisted computation, even though it is a sibling of the well-understood eigenvalue and singular value decompositions. Several algorithms have been developed for the reduced 2-by-1 form of the decomposition, but none have been extended to ... [SIAM. J. Matrix Anal. & Appl. 33, 1 (2012)] published Thu Jan 5, 2012. Erratum http://link.aip.org/link/?SML/32/1559/1&agg=rss SIAM<br/> A production error resulted in incorrect information regarding the affiliations of the authors of Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors" (SIAM J. Matrix Anal. Appl., 32 (2011), pp. 806819). None of the authors is connected with Nankai Uni ... [SIAM. J. Matrix Anal. & Appl. 32, 1559 (2011)] published Tue Dec 20, 2011. Using the Restricted-denominator Rational Arnoldi Method for Exponential Integrators http://link.aip.org/link/?SML/32/1537/1&agg=rss Paolo Novati<br/> In this paper we investigate some practical aspects concerning the use of the restricted-denominator rational Arnoldi method for the computation of the core functions of exponential integrators for parabolic problems. We derive some useful a posteriori bounds together with hints for a suitable impl ... [SIAM. J. Matrix Anal. & Appl. 32, 1537 (2011)] published Tue Dec 20, 2011.