Does the ability to reason well make one less likely to engage in motivated reasoning? Following a paradigm used by Kahan, Peters, Dawson, and Slovic (2013), this study aims to replicate, extend, and explain the surprising finding that those most likely to process politicized data in a biased manner are those who score highest on a measure of numerical proficiency. Although our study found gene...

In this paper we propose a fast structure-preserving algorithm for computing the singular value decomposition of quaternion matrices. The algorithm is based on the structurepreserving bidiagonalization of the real counterpart for quaternion matrices by applying orthogonal JRS-symplectic matrices. The algorithm is efficient and numerically stable. 2014 Elsevier Inc. All rights reserved.

Involuntary outpatient commitment is a highly controversial issue in mental health law. Strong supporters of outpatient commitment see it as a form of access to community-based mental health care and a less restrictive alternative to hospitalization for people with severe mental illness; vocal opponents see it as an instrument of social control and an unwarranted deprivation of individual liber...

This annotated bibliography is a complement to a set of course notes for CS 279, System Support for Scientific Computation, taught in Spring 2001 by W. Kahan at UC Berkeley. It is meant to be representative, not comprehensive, and includes pointers to survey works and online bibliographies which cover the literature in various areas in more depth. In the hope of making the bilbiography simpler ...

in this work‎, ‎an iterative method based on a matrix form of lsqr algorithm is constructed for solving the linear operator equation $mathcal{a}(x)=b$‎ ‎and the minimum frobenius norm residual problem $||mathcal{a}(x)-b||_f$‎ ‎where $xin mathcal{s}:={xin textsf{r}^{ntimes n}~|~x=mathcal{g}(x)}$‎, ‎$mathcal{f}$ is the linear operator from $textsf{r}^{ntimes n}$ onto $textsf{r}^{rtimes s}$‎, ‎$ma...

We develop probabilistic upper bounds for the matrix two-norm, the largest singular value. These bounds, which are true upper bounds with a userchosen high probability, are derived with a number of different polynomials that implicitly arise in the Lanczos bidiagonalization process. Since these polynomials are adaptively generated, the bounds typically give very good results. They can be comput...

The generalized eigenvalue problem ̃ Hy= λHy with H a Hankel matrix and ̃ H the corresponding shifted Hankel matrix occurs in number of applications such as the reconstruction of the shape of a polygon from its moments, the determination of abscissa of quadrature formulas, of poles of Padé approximants, or of the unknown powers of a sparse black box polynomial in computer algebra. In many of th...

Complex systems of interactions govern the structure and function of biomolecules. Mutations that substantially disrupt these interactions are deleterious and should not persist under selection. Yet, several instances have been reported where a variant confirmed as pathogenic in one species is fixed in the orthologs of other species. Here we introduce a novel method for detecting compensatory s...

Classical matrix perturbation results, such as Weyl’s theorem for eigenvalues andthe Davis-Kahan theorem for eigenvectors, are general purpose. These classicalbounds are tight in the worst case, but in many settings sub-optimal in the typicalcase. In this paper, we present perturbation bounds which consider the nature ofthe perturbation and its interaction with the unperturbed s...