Generalized Inverses: Theory and Applications ... - Benisrael.net

BIBLIOGRAPHY 9206. , Rank factorization of a matrix and its applications,Math. Sci. 13 (1988), no. 1, 4–14, (see[1587]).207. P. Bhimasankaram and T. Mathew, On orderingproperties of generalized inverses of nonnegativedefinite matrices, Linear Algebra and its Applications183 (1993), 131–146.208. P. Bhimasankaram and R. SahaRay, On a partitionedlinear model and some associated reducedmodels, Linear Algebra and its Applications 264(1997), 329–339.209. M. Bilodeau, Sur une représentation explicitedes solutions optimales d’un programme linéaire,Canad. Math. Bull. 29 (1986), no. 4, 419–425.210. G. D. Birkhoff, Review of “The New Haven Colloquium.by E. H. Moore, E. J. Wilczynski, M.Mason. Yale University Press, 1910, x + 222 p.”,Bull. Amer. Math. Soc. 17 (1911), 414–428.211. Z. W. Birnbaum, Introduction to Probability andMathematical Statistics, Harper & Brothers, Publishers,New York, 1962.212. A. Bjerhammar, Application of calculus of matricesto method of least squares with special reference togeodetic calculations, Trans. Roy. Inst. Tech. Stockholm1951 (1951), no. 49, 86 pp. (2 plates).213. , Rectangular reciprocal matrices, withspecial reference to geodetic calculations, Bull.Géodésique (1951), 188–220.214. , A generalized matrix algebra, Trans. Roy.Inst. Tech. Stockholm 1958 (1958), no. 124, 32 pp.215. , Studies with generalized matrix algebra,Bull. Géodésique (N.S.) No. 85 (1967), 193–210.216. , Theory of Errors and Generalized MatrixInverses, Elsevier Scientific Publishing Co., Amsterdam,1973.217. Å. Björck, Iterative refinement of linear leastsquares solutions I, BIT 7 (1967), 257–278.218. , Solving linear least squares problems byGram–Schmidt orthogonalization, BIT 7 (1967), 1–21.219. , Iterative refinement of linear least squaressolutions II, BIT 8 (1968), 8–30.220. , A uniform numerical method for linear estimationfrom general Gauss-Markov models, Proceedingsof the First Symposium on ComutationalStatistics (COMPSTAT), (G. Bruckmann, F. Ferschland L. Schmetterer, Editors), Physica Verlag,Vienna, 1974, pp. 131–140.221. , Numerical Methods for Least SquaresProblems, Society for Industrial and Applied Mathematics(SIAM), Philadelphia, PA, 1994.222. Å. Björck and C. Bowie, An iterative algorithm forcomputing the best estimate of an orthogonal matrix,SIAJN 8 (1971), no. 2, 358–364.223. Å. Björck and T. Elfving, Accelerated projectionmethods for computing pseudoinverse solutions ofsystems of linear equations, BIT 19 (1979), 145–163.224. Å. Björck and G. H. Golub, Iterative refinement oflinear least squares solutions by householder transformation,BIT 7 (1967), 322–337.225. , Numerical methods for computing anglesbetween linear subspaces, Mathematics of Computation27 (1973), 579–594.226. B. Blaschke, A. Neubauer, and O. Scherzer, Onconvergence rates for the iteratively regularizedGauss-Newton method, IMA J. Numer. Anal. 17(1997), no. 3, 421–436.227. J. Blatter and E. W. Cheney, On the existence ofextremal projections, J. Approximation Theory 6(1972), 72–79.228. J. W. Blattner, Bordered matrices, J. Soc. Indust.Appl. Math. 10 (1962), 528–536.229. , On the convergence of a certain matrix iteration,Bul. Inst. Politehn. Iaşi (N.S.) 10 (14)(1964), no. 3-4, 43–46.230. G. A. Bliss, Eliakim Hastings Moore, Bull. Amer.Math. Soc. 39 (1933), 831–838.231. , The scientific work of Eliakim HastingsMoore, Bull. Amer. Math. Soc. 40 (1934), 501–514.232. L. Bober and P. Chrzan, Application of the generalizedMoore-Penrose matrix inversion to the estimationof a classical econometric model under additionalconstraints, Przegl ‘ad Statyst. 25 (1978),no. 3, 315–324 (1979).233. E. Y. Bobrovnikova and S. A. Vavasis, A normbound for projections with complex weights, LinearAlgebra and its Applications 307 (2000), no. 1-3,69–75, (a complex version of the bounds in [1764],[1846]).234. P. T. Boggs, The convergence of the Ben-Israel iterationfor nonlinear least squares problems, Math.Comp. 30 (1976), no. 135, 512–522.235. E. Bohl and P. Lancaster, Perturbation of spectralinverses applied to a boundary layer phenomenonarising in chemical networks, Linear Algebra andits Applications 180 (1993), 35–59.236. F. Bohnenblust, A characterization of complexHilbert spaces, Portugal. Math. 3 (1942), 103–109.237. E. Boman and I. Koltracht, Computing preconditionersvia subspace projection, Linear Algebra andits Applications 302/303 (1999), 347–353.238. T. Bonnesen and W. Fenchel, Theorie der konvexenKörper, Springer, Berlin, 1934.239. C. de Boor, The Method of Projections as appliedto the Numerical Solution of Two Point BoundaryValue Problems using Cubic Splines, Doctoral dissertationin mathematics, University of Michigan,Ann Arbor, MI, 1966.240. , Convergence of abstract splines, J. Approx.Theory 31 (1981), no. 1, 80–89.241. J. C. G. Boot, The computation of the generalizedinverse of singular or rectangular matrices, Amer.Math. Monthly 70 (1963), 302–303.242. E. Boroş, On the generalized inverse of an EP rmatrix, An. Univ. Timişoara Ser. Şti. Mat.-Fiz. No.2 (1964), 33–38.