![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Nicholas J. Higham
Person information
- affiliation: University of Manchester, UK
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j115]Patrick Amestoy, Alfredo Buttari
, Nicholas J. Higham
, Jean-Yves L'Excellent, Théo Mary, Bastien Vieuble:
Five-Precision GMRES-Based Iterative Refinement. SIAM J. Matrix Anal. Appl. 45(1): 529-552 (2024) - 2023
- [j114]Massimiliano Fasi
, Nicholas J. Higham
, Xiaobo Liu
:
Computing the Square Root of a Low-Rank Perturbation of the Scaled Identity Matrix. SIAM J. Matrix Anal. Appl. 44(1): 156-174 (2023) - [j113]Michael P. Connolly, Nicholas J. Higham
:
Probabilistic Rounding Error Analysis of Householder QR Factorization. SIAM J. Matrix Anal. Appl. 44(3): 1146-1163 (2023) - [j112]Massimiliano Fasi
, Nicholas J. Higham
, Florent Lopez, Théo Mary, Mantas Mikaitis
:
Matrix Multiplication in Multiword Arithmetic: Error Analysis and Application to GPU Tensor Cores. SIAM J. Sci. Comput. 45(1): 1- (2023) - [j111]Patrick Amestoy
, Alfredo Buttari
, Nicholas J. Higham
, Jean-Yves L'Excellent
, Théo Mary
, Bastien Vieuble
:
Combining Sparse Approximate Factorizations with Mixed-precision Iterative Refinement. ACM Trans. Math. Softw. 49(1): 4:1-4:29 (2023) - [i4]Nicholas J. Higham:
The Power of Bidiagonal Matrices. CoRR abs/2311.06609 (2023) - 2022
- [j110]Nicholas J. Higham
, Théo Mary:
Mixed precision algorithms in numerical linear algebra. Acta Numer. 31: 347-414 (2022) - [j109]Sven Hammarling
, Nicholas J. Higham:
The Influence and Contribution of Jack Dongarra to Numerical Linear Algebra. Comput. Sci. Eng. 24(4): 6-11 (2022) - [j108]Nicholas J. Higham
, Mantas Mikaitis
:
Anymatrix: an extensible MATLAB matrix collection. Numer. Algorithms 90(3): 1175-1196 (2022) - [j107]Mawussi Zounon, Nicholas J. Higham, Craig Lucas, Françoise Tisseur:
Performance impact of precision reduction in sparse linear systems solvers. PeerJ Comput. Sci. 8: e778 (2022) - [j106]Awad H. Al-Mohy
, Nicholas J. Higham
, Xiaobo Liu
:
Arbitrary Precision Algorithms for Computing the Matrix Cosine and its Fréchet Derivative. SIAM J. Matrix Anal. Appl. 43(1): 233-256 (2022) - [j105]Nicholas J. Higham
, Matthew C. Lettington
:
Optimizing and Factorizing the Wilson Matrix. Am. Math. Mon. 129(5): 454-465 (2022) - 2021
- [j104]Ahmad Abdelfattah, Hartwig Anzt
, Erik G. Boman, Erin C. Carson, Terry Cojean
, Jack J. Dongarra, Alyson Fox
, Mark Gates
, Nicholas J. Higham, Xiaoye S. Li, Jennifer A. Loe
, Piotr Luszczek, Srikara Pranesh, Siva Rajamanickam, Tobias Ribizel
, Barry F. Smith, Kasia Swirydowicz, Stephen J. Thomas, Stanimire Tomov
, Yaohung M. Tsai, Ulrike Meier Yang
:
A survey of numerical linear algebra methods utilizing mixed-precision arithmetic. Int. J. High Perform. Comput. Appl. 35(4) (2021) - [j103]Massimiliano Fasi
, Nicholas J. Higham
, Mantas Mikaitis
, Srikara Pranesh:
Numerical behavior of NVIDIA tensor cores. PeerJ Comput. Sci. 7: e330 (2021) - [j102]Desmond J. Higham
, Nicholas J. Higham
, Srikara Pranesh:
Random Matrices Generating Large Growth in LU Factorization with Pivoting. SIAM J. Matrix Anal. Appl. 42(1): 185-201 (2021) - [j101]Massimiliano Fasi
, Nicholas J. Higham
:
Matrices with Tunable Infinity-Norm Condition Number and No Need for Pivoting in LU Factorization. SIAM J. Matrix Anal. Appl. 42(1): 417-435 (2021) - [j100]Nicholas J. Higham
, Xiaobo Liu
:
A Multiprecision Derivative-Free Schur-Parlett Algorithm for Computing Matrix Functions. SIAM J. Matrix Anal. Appl. 42(3): 1401-1422 (2021) - [j99]Nicholas J. Higham
, Srikara Pranesh:
Exploiting Lower Precision Arithmetic in Solving Symmetric Positive Definite Linear Systems and Least Squares Problems. SIAM J. Sci. Comput. 43(1): A258-A277 (2021) - [j98]Michael P. Connolly, Nicholas J. Higham
, Théo Mary:
Stochastic Rounding and Its Probabilistic Backward Error Analysis. SIAM J. Sci. Comput. 43(1): A566-A585 (2021) - [j97]Massimiliano Fasi
, Nicholas J. Higham
:
Generating Extreme-Scale Matrices With Specified Singular Values or Condition Number. SIAM J. Sci. Comput. 43(1): A663-A684 (2021) - [j96]Ahmad Abdelfattah, Timothy B. Costa, Jack J. Dongarra, Mark Gates
, Azzam Haidar, Sven Hammarling
, Nicholas J. Higham, Jakub Kurzak, Piotr Luszczek
, Stanimire Tomov
, Mawussi Zounon:
A Set of Batched Basic Linear Algebra Subprograms and LAPACK Routines. ACM Trans. Math. Softw. 47(3): 21:1-21:23 (2021) - 2020
- [j95]Pierre Blanchard, Nicholas J. Higham
, Théo Mary
:
A Class of Fast and Accurate Summation Algorithms. SIAM J. Sci. Comput. 42(3): A1541-A1557 (2020) - [j94]Pierre Blanchard, Nicholas J. Higham
, Florent Lopez, Théo Mary
, Srikara Pranesh:
Mixed Precision Block Fused Multiply-Add: Error Analysis and Application to GPU Tensor Cores. SIAM J. Sci. Comput. 42(3): C124-C141 (2020) - [j93]Nicholas J. Higham
, Théo Mary:
Sharper Probabilistic Backward Error Analysis for Basic Linear Algebra Kernels with Random Data. SIAM J. Sci. Comput. 42(5): A3427-A3446 (2020) - [j92]Erin C. Carson
, Nicholas J. Higham
, Srikara Pranesh:
Three-Precision GMRES-Based Iterative Refinement for Least Squares Problems. SIAM J. Sci. Comput. 42(6): A4063-A4083 (2020) - [i3]Ahmad Abdelfattah, Hartwig Anzt, Erik G. Boman, Erin C. Carson, Terry Cojean
, Jack J. Dongarra, Mark Gates, Thomas Grützmacher, Nicholas J. Higham, Xiaoye Sherry Li, Neil Lindquist, Yang Liu, Jennifer A. Loe, Piotr Luszczek, Pratik Nayak, Srikara Pranesh, Sivasankaran Rajamanickam, Tobias Ribizel, Barry Smith, Kasia Swirydowicz, Stephen J. Thomas, Stanimire Tomov, Yaohung M. Tsai, Ichitaro Yamazaki, Ulrike Meier Yang:
A Survey of Numerical Methods Utilizing Mixed Precision Arithmetic. CoRR abs/2007.06674 (2020)
2010 – 2019
- 2019
- [j91]Hartwig Anzt
, Jack J. Dongarra, Goran Flegar
, Nicholas J. Higham, Enrique S. Quintana-Ortí
:
Adaptive precision in block-Jacobi preconditioning for iterative sparse linear system solvers. Concurr. Comput. Pract. Exp. 31(6) (2019) - [j90]Massimiliano Fasi
, Nicholas J. Higham
:
An Arbitrary Precision Scaling and Squaring Algorithm for the Matrix Exponential. SIAM J. Matrix Anal. Appl. 40(4): 1233-1256 (2019) - [j89]Nicholas J. Higham
, Théo Mary
:
A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error. SIAM J. Sci. Comput. 41(1): A59-A82 (2019) - [j88]Nicholas J. Higham
, Srikara Pranesh, Mawussi Zounon:
Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems. SIAM J. Sci. Comput. 41(4): A2536-A2551 (2019) - [j87]Nicholas J. Higham
, Théo Mary
:
A New Approach to Probabilistic Rounding Error Analysis. SIAM J. Sci. Comput. 41(5): A2815-A2835 (2019) - [j86]Nicholas J. Higham
, Srikara Pranesh:
Simulating Low Precision Floating-Point Arithmetic. SIAM J. Sci. Comput. 41(5): C585-C602 (2019) - [i2]Pierre Blanchard, Desmond J. Higham, Nicholas J. Higham:
Accurate Computation of the Log-Sum-Exp and Softmax Functions. CoRR abs/1909.03469 (2019) - 2018
- [j85]Massimiliano Fasi
, Nicholas J. Higham
:
Multiprecision Algorithms for Computing the Matrix Logarithm. SIAM J. Matrix Anal. Appl. 39(1): 472-491 (2018) - [j84]Erin C. Carson
, Nicholas J. Higham
:
Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions. SIAM J. Sci. Comput. 40(2) (2018) - [j83]Prashanth Nadukandi
, Nicholas J. Higham
:
Computing the Wave-Kernel Matrix Functions. SIAM J. Sci. Comput. 40(6): A4060-A4082 (2018) - [c9]Azzam Haidar, Stanimire Tomov, Jack J. Dongarra, Nicholas J. Higham:
Harnessing GPU tensor cores for fast FP16 arithmetic to speed up mixed-precision iterative refinement solvers. SC 2018: 47:1-47:11 - [c8]Weijian Zhang, Jonathan Deakin, Nicholas J. Higham, Shuaiqiang Wang:
Etymo: A New Discovery Engine for AI Research. WWW (Companion Volume) 2018: 227-230 - [i1]Weijian Zhang, Jonathan Deakin, Nicholas J. Higham, Shuaiqiang Wang:
Etymo: A New Discovery Engine for AI Research. CoRR abs/1801.08573 (2018) - 2017
- [j82]Nicholas J. Higham
, Peter Kandolf
:
Computing the Action of Trigonometric and Hyperbolic Matrix Functions. SIAM J. Sci. Comput. 39(2) (2017) - [j81]Erin C. Carson
, Nicholas J. Higham
:
A New Analysis of Iterative Refinement and Its Application to Accurate Solution of Ill-Conditioned Sparse Linear Systems. SIAM J. Sci. Comput. 39(6) (2017) - [c7]Nicholas John Higham:
The Rise of Multiprecision Arithmetic. ARITH 2017: 1 - [c6]Jack J. Dongarra, Sven Hammarling, Nicholas J. Higham
, Samuel D. Relton
, Mawussi Zounon
:
Optimized Batched Linear Algebra for Modern Architectures. Euro-Par 2017: 511-522 - [c5]Jack J. Dongarra, Sven Hammarling, Nicholas J. Higham
, Samuel D. Relton
, Pedro Valero-Lara
, Mawussi Zounon
:
The Design and Performance of Batched BLAS on Modern High-Performance Computing Systems. ICCS 2017: 495-504 - 2016
- [j80]Mary Aprahamian, Desmond J. Higham
, Nicholas J. Higham
:
Matching exponential-based and resolvent-based centrality measures. J. Complex Networks 4(2): 157-176 (2016) - [j79]Nicholas J. Higham
, Natasa Strabic:
Anderson acceleration of the alternating projections method for computing the nearest correlation matrix. Numer. Algorithms 72(4): 1021-1042 (2016) - [j78]Nicholas J. Higham
, Vanni Noferini
:
An algorithm to compute the polar decomposition of a 3 × 3 matrix. Numer. Algorithms 73(2): 349-369 (2016) - [j77]Weijian Zhang, Nicholas J. Higham
:
Matrix Depot: an extensible test matrix collection for Julia. PeerJ Comput. Sci. 2: e58 (2016) - [j76]Nicholas J. Higham
, Natasa Strabic:
Bounds for the Distance to the Nearest Correlation Matrix. SIAM J. Matrix Anal. Appl. 37(3): 1088-1102 (2016) - [j75]Mary Aprahamian, Nicholas J. Higham:
Matrix Inverse Trigonometric and Inverse Hyperbolic Functions: Theory and Algorithms. SIAM J. Matrix Anal. Appl. 37(4): 1453-1477 (2016) - [j74]Nicholas J. Higham
, Natasa Strabic, Vedran Sego:
Restoring Definiteness via Shrinking, with an Application to Correlation Matrices with a Fixed Block. SIAM Rev. 58(2): 245-263 (2016) - [j73]Nicholas J. Higham, Samuel D. Relton
:
Estimating the Largest Elements of a Matrix. SIAM J. Sci. Comput. 38(5) (2016) - [j72]Edvin Deadman, Nicholas J. Higham
:
Testing Matrix Function Algorithms Using Identities. ACM Trans. Math. Softw. 42(1): 4:1-4:15 (2016) - 2015
- [j71]Massimiliano Fasi
, Nicholas J. Higham
, Bruno Iannazzo
:
An Algorithm for the Matrix Lambert W Function. SIAM J. Matrix Anal. Appl. 36(2): 669-685 (2015) - [j70]Awad H. Al-Mohy
, Nicholas J. Higham
, Samuel D. Relton
:
New Algorithms for Computing the Matrix Sine and Cosine Separately or Simultaneously. SIAM J. Sci. Comput. 37(1) (2015) - 2014
- [j69]Lijing Lin
, Nicholas J. Higham
, Jianxin Pan:
Covariance structure regularization via entropy loss function. Comput. Stat. Data Anal. 72: 315-327 (2014) - [j68]Iain Bethune, J. Mark Bull, Nicholas J. Dingle, Nicholas J. Higham
:
Performance analysis of asynchronous Jacobi's method implemented in MPI, SHMEM and OpenMP. Int. J. High Perform. Comput. Appl. 28(1): 97-111 (2014) - [j67]Mary Aprahamian, Nicholas J. Higham
:
The Matrix Unwinding Function, with an Application to Computing the Matrix Exponential. SIAM J. Matrix Anal. Appl. 35(1): 88-109 (2014) - [j66]Nicholas J. Higham
, Samuel D. Relton
:
Higher Order Fréchet Derivatives of Matrix Functions and the Level-2 Condition Number. SIAM J. Matrix Anal. Appl. 35(3): 1019-1037 (2014) - [j65]Nicholas J. Higham
, Samuel D. Relton
:
Estimating the Condition Number of the Fréchet Derivative of a Matrix Function. SIAM J. Sci. Comput. 36(6) (2014) - 2013
- [j64]Nicholas J. Higham
, Lijing Lin
:
An Improved Schur-Padé Algorithm for Fractional Powers of a Matrix and Their Fréchet Derivatives. SIAM J. Matrix Anal. Appl. 34(3): 1341-1360 (2013) - [j63]Yuji Nakatsukasa
, Nicholas J. Higham
:
Stable and Efficient Spectral Divide and Conquer Algorithms for the Symmetric Eigenvalue Decomposition and the SVD. SIAM J. Sci. Comput. 35(3) (2013) - [j62]Awad H. Al-Mohy
, Nicholas J. Higham
, Samuel D. Relton
:
Computing the Fréchet Derivative of the Matrix Logarithm and Estimating the Condition Number. SIAM J. Sci. Comput. 35(4) (2013) - [j61]Timo Betcke
, Nicholas J. Higham
, Volker Mehrmann, Christian Schröder, Françoise Tisseur:
NLEVP: A Collection of Nonlinear Eigenvalue Problems. ACM Trans. Math. Softw. 39(2): 7:1-7:28 (2013) - [j60]Nicholas J. Dingle, Nicholas J. Higham
:
Reducing the influence of tiny normwise relative errors on performance profiles. ACM Trans. Math. Softw. 39(4): 24:1-24:11 (2013) - 2012
- [j59]Yuji Nakatsukasa
, Nicholas J. Higham
:
Backward Stability of Iterations for Computing the Polar Decomposition. SIAM J. Matrix Anal. Appl. 33(2): 460-479 (2012) - [j58]Awad H. Al-Mohy
, Nicholas J. Higham
:
Improved Inverse Scaling and Squaring Algorithms for the Matrix Logarithm. SIAM J. Sci. Comput. 34(4) (2012) - [c4]Edvin Deadman, Nicholas J. Higham
, Rui Ralha
:
Blocked Schur Algorithms for Computing the Matrix Square Root. PARA 2012: 171-182 - 2011
- [j57]Nicholas J. Higham
, Lijing Lin
:
A Schur-Padé Algorithm for Fractional Powers of a Matrix. SIAM J. Matrix Anal. Appl. 32(3): 1056-1078 (2011) - [j56]Awad H. Al-Mohy
, Nicholas J. Higham
:
Computing the Action of the Matrix Exponential, with an Application to Exponential Integrators. SIAM J. Sci. Comput. 33(2): 488-511 (2011) - 2010
- [j55]Nicholas J. Higham
, Awad H. Al-Mohy
:
Computing matrix functions. Acta Numer. 19: 159-208 (2010) - [j54]Awad H. Al-Mohy
, Nicholas J. Higham
:
The complex step approximation to the Fréchet derivative of a matrix function. Numer. Algorithms 53(1): 133-148 (2010) - [j53]Nicholas J. Higham
, Christian Mehl, Françoise Tisseur
:
The Canonical Generalized Polar Decomposition. SIAM J. Matrix Anal. Appl. 31(4): 2163-2180 (2010) - [j52]Rüdiger Borsdorf, Nicholas J. Higham
, Marcos Raydan:
Computing a Nearest Correlation Matrix with Factor Structure. SIAM J. Matrix Anal. Appl. 31(5): 2603-2622 (2010)
2000 – 2009
- 2009
- [j51]Anne E. Trefethen, Nicholas J. Higham
, Iain S. Duff, Peter V. Coveney:
Developing a High-Performance Computing/Numerical Analysis Roadmap. Int. J. High Perform. Comput. Appl. 23(4): 423-426 (2009) - [j50]Nicholas J. Higham
, D. Steven Mackey
, Françoise Tisseur
:
Definite Matrix Polynomials and their Linearization by Definite Pencils. SIAM J. Matrix Anal. Appl. 31(2): 478-502 (2009) - [j49]Awad H. Al-Mohy
, Nicholas J. Higham
:
A New Scaling and Squaring Algorithm for the Matrix Exponential. SIAM J. Matrix Anal. Appl. 31(3): 970-989 (2009) - [j48]Chun-Hua Guo, Nicholas J. Higham
, Françoise Tisseur
:
An Improved Arc Algorithm for Detecting Definite Hermitian Pairs. SIAM J. Matrix Anal. Appl. 31(3): 1131-1151 (2009) - [j47]Nicholas J. Higham
:
The Scaling and Squaring Method for the Matrix Exponential Revisited. SIAM Rev. 51(4): 747-764 (2009) - 2008
- [b6]Nicholas J. Higham
:
Functions of matrices - theory and computation. SIAM 2008, ISBN 978-0-89871-646-7, pp. I-XX, 1-425 - [j46]Chun-Hua Guo, Nicholas J. Higham
, Françoise Tisseur
:
Detecting and Solving Hyperbolic Quadratic Eigenvalue Problems. SIAM J. Matrix Anal. Appl. 30(4): 1593-1613 (2008) - [j45]Awad H. Al-Mohy
, Nicholas J. Higham
:
Computing the Fréchet Derivative of the Matrix Exponential, with an Application to Condition Number Estimation. SIAM J. Matrix Anal. Appl. 30(4): 1639-1657 (2008) - [j44]Nicholas Hale
, Nicholas J. Higham, Lloyd N. Trefethen:
Computing AAlpha, log(A), and Related Matrix Functions by Contour Integrals. SIAM J. Numer. Anal. 46(5): 2505-2523 (2008) - 2007
- [j43]Chun-Hua Guo, Nicholas J. Higham
:
Iterative Solution of a Nonsymmetric Algebraic Riccati Equation. SIAM J. Matrix Anal. Appl. 29(2): 396-412 (2007) - [j42]Nicholas J. Higham
, Ren-Cang Li
, Françoise Tisseur
:
Backward Error of Polynomial Eigenproblems Solved by Linearization. SIAM J. Matrix Anal. Appl. 29(4): 1218-1241 (2007) - [p1]Nicholas J. Higham:
Commentary. Milestones in Matrix Computation 2007: 227-232 - 2006
- [j41]Chun-Hua Guo, Nicholas J. Higham
:
A Schur-Newton Method for the Matrix \lowercase{\boldmathp}th Root and its Inverse. SIAM J. Matrix Anal. Appl. 28(3): 788-804 (2006) - [j40]Nicholas J. Higham
, D. Steven Mackey
, Françoise Tisseur
:
The Conditioning of Linearizations of Matrix Polynomials. SIAM J. Matrix Anal. Appl. 28(4): 1005-1028 (2006) - [j39]Nicholas J. Higham
, D. Steven Mackey
, Niloufer Mackey, Françoise Tisseur
:
Symmetric Linearizations for Matrix Polynomials. SIAM J. Matrix Anal. Appl. 29(1): 143-159 (2006) - [c3]Sven Hammarling, Nicholas J. Higham
, Craig Lucas:
LAPACK-Style Codes for Pivoted Cholesky and QR Updating. PARA 2006: 137-146 - 2005
- [b5]Desmond J. Higham, Nicholas J. Higham:
Matlab guide, Second Edition. SIAM 2005, ISBN 978-0-89871-578-1, pp. I-XXIII, 1-382 - [j38]Dario Andrea Bini, Nicholas J. Higham
, Beatrice Meini
:
Algorithms for the matrix pth root. Numer. Algorithms 39(4): 349-378 (2005) - [j37]Gareth I. Hargreaves, Nicholas J. Higham
:
Efficient algorithms for the matrix cosine and sine. Numer. Algorithms 40(4): 383-400 (2005) - [j36]Nicholas J. Higham
, D. Steven Mackey
, Niloufer Mackey, Françoise Tisseur
:
Functions Preserving Matrix Groups and Iterations for the Matrix Square Root. SIAM J. Matrix Anal. Appl. 26(3): 849-877 (2005) - [j35]Nicholas J. Higham
:
The Scaling and Squaring Method for the Matrix Exponential Revisited. SIAM J. Matrix Anal. Appl. 26(4): 1179-1193 (2005) - 2004
- [j34]Nicholas J. Higham
, D. Steven Mackey
, Niloufer Mackey, Françoise Tisseur
:
Computing the Polar Decomposition and the Matrix Sign Decomposition in Matrix Groups. SIAM J. Matrix Anal. Appl. 25(4): 1178-1192 (2004) - 2003
- [j33]Nicholas J. Higham
, Matthew I. Smith:
Computing the Matrix Cosine. Numer. Algorithms 34(1): 13-26 (2003) - [j32]Adam W. Bojanczyk, Nicholas J. Higham
, Harikrishna Patel:
Solving the Indefinite Least Squares Problem by Hyperbolic QR Factorization. SIAM J. Matrix Anal. Appl. 24(4): 914-931 (2003) - [j31]Philip I. Davies, Nicholas J. Higham
:
A Schur-Parlett Algorithm for Computing Matrix Functions. SIAM J. Matrix Anal. Appl. 25(2): 464-485 (2003) - [j30]Nicholas J. Higham
:
J-Orthogonal Matrices: Properties and Generation. SIAM Rev. 45(3): 504-519 (2003) - 2002
- [b4]Nicholas J. Higham
:
Accuracy and stability of numerical algorithms, Second Edition. SIAM 2002, ISBN 978-0-89871-521-7, pp. I-XXX, 1-680 - 2001
- [j29]Sheung Hun Cheng, Nicholas J. Higham
, Charles S. Kenney, Alan J. Laub:
Approximating the Logarithm of a Matrix to Specified Accuracy. SIAM J. Matrix Anal. Appl. 22(4): 1112-1125 (2001) - [j28]Nicholas J. Higham
:
Evaluating Padé Approximants of the Matrix Logarithm. SIAM J. Matrix Anal. Appl. 22(4): 1126-1135 (2001) - [j27]Françoise Tisseur
, Nicholas J. Higham
:
Structured Pseudospectra for Polynomial Eigenvalue Problems, with Applications. SIAM J. Matrix Anal. Appl. 23(1): 187-208 (2001) - [j26]Nicholas J. Higham
, Hyun-Min Kim:
Solving a Quadratic Matrix Equation by Newton's Method with Exact Line Searches. SIAM J. Matrix Anal. Appl. 23(2): 303-316 (2001) - [j25]Philip I. Davies, Nicholas J. Higham
, Françoise Tisseur
:
Analysis of the Cholesky Method with Iterative Refinement for Solving the Symmetric Definite Generalized Eigenproblem. SIAM J. Matrix Anal. Appl. 23(2): 472-493 (2001) - [c2]Sheung Hun Cheng, Nicholas J. Higham:
Parallel Implementation of a Block Algorithm for Matrix 1-Norm Estimation. Euro-Par 2001: 568-577 - 2000
- [b3]Desmond J. Higham, Nicholas J. Higham:
Matlab guide. SIAM 2000, ISBN 978-0-89871-469-2, pp. I-XXII, 1-283 - [j24]Nicholas J. Higham
, Françoise Tisseur
:
A Block Algorithm for Matrix 1-Norm Estimation, with an Application to 1-Norm Pseudospectra. SIAM J. Matrix Anal. Appl. 21(4): 1185-1201 (2000)
1990 – 1999
- 1999
- [j23]Anthony J. Cox, Nicholas J. Higham
:
Row-Wise Backward Stable Elimination Methods for the Equality Constrained Least Squares Problem. SIAM J. Matrix Anal. Appl. 21(1): 313-326 (1999) - 1998
- [j22]Nicholas J. Higham
:
Factorizing complex symmetric matrices with positive definite real and imaginary parts. Math. Comput. 67(224): 1591-1599 (1998) - [j21]Sheung Hun Cheng, Nicholas J. Higham
:
A Modified Cholesky Algorithm Based on a Symmetric Indefinite Factorization. SIAM J. Matrix Anal. Appl. 19(4): 1097-1110 (1998) - [j20]Desmond J. Higham
, Nicholas J. Higham
:
Structured Backward Error and Condition of Generalized Eigenvalue Problems. SIAM J. Matrix Anal. Appl. 20(2): 493-512 (1998) - 1997
- [j19]Nicholas J. Higham
:
Stable iterations for the matrix square root. Numer. Algorithms 15(2): 227-242 (1997) - [j18]Nicholas J. Higham
:
Stability of the Diagonal Pivoting Method with Partial Pivoting. SIAM J. Matrix Anal. Appl. 18(1): 52-65 (1997) - 1996
- [b2]Nicholas J. Higham:
Accuracy and stability of numerical algorithms. SIAM 1996, ISBN 978-0-89871-355-8, pp. I-XXVIII, 1-688 - [c1]Nicholas J. Higham:
Testing linear algebra software. Quality of Numerical Software 1996: 109-124 - 1995
- [j17]James Weldon Demmel, Nicholas J. Higham
, Robert S. Schreiber:
Stability of block LU factorization. Numer. Linear Algebra Appl. 2(2): 173-190 (1995) - [j16]Nicholas J. Higham
, Philip A. Knight:
Matrix Powers in Finite Precision Arithmetic. SIAM J. Matrix Anal. Appl. 16(2): 343-358 (1995) - [j15]Nicholas J. Higham
:
Stability of Parallel Triangular System Solvers. SIAM J. Sci. Comput. 16(2): 400-413 (1995) - 1994
- [j14]Nicholas J. Higham
, Pythagoras Papadimitriou:
A Parallel Algorithm for Computing the Polar Decomposition. Parallel Comput. 20(8): 1161-1173 (1994) - [j13]Nicholas J. Higham
, Alex Pothen
:
Stability of the Partitioned Inverse Method for Parallel Solution of Sparse Triangular Systems. SIAM J. Sci. Comput. 15(1): 139-148 (1994) - 1993
- [b1]Nicholas J. Higham:
Handbook of writing for the mathematical sciences. SIAM 1993, ISBN 978-0-89871-314-5, pp. I-XII, 1-241 - [j12]James Weldon Demmel, Nicholas J. Higham
:
Improved Error Bounds for Underdetermined System Solvers. SIAM J. Matrix Anal. Appl. 14(1): 1-14 (1993) - [j11]Nicholas J. Higham
:
Optimization by Direct Search in Matrix Computations. SIAM J. Matrix Anal. Appl. 14(2): 317-333 (1993) - [j10]Nicholas J. Higham
:
The Accuracy of Floating Point Summation. SIAM J. Sci. Comput. 14(4): 783-799 (1993) - 1992
- [j9]Desmond J. Higham
, Nicholas J. Higham
:
Backward Error and Condition of Structured Linear Systems. SIAM J. Matrix Anal. Appl. 13(1): 162-175 (1992) - [j8]Nicholas J. Higham
:
Stability of a Method for Multiplying Complex Matrices with Three Real Matrix Multiplications. SIAM J. Matrix Anal. Appl. 13(3): 681-687 (1992) - [j7]James Demmel, Nicholas J. Higham
:
Stability of block algorithms with fast level-3 BLAS. ACM Trans. Math. Softw. 18(3): 274-291 (1992) - 1991
- [j6]Nicholas J. Higham
:
Algorithm 694: a collection of test matrices in MATLAB. ACM Trans. Math. Softw. 17(3): 289-305 (1991) - 1990
- [j5]Nicholas J. Higham
, Robert S. Schreiber:
Fast Polar Decomposition of an Arbitrary Matrix. SIAM J. Sci. Comput. 11(4): 648-655 (1990) - [j4]Nicholas J. Higham
:
Experience with a Matrix Norm Estimator. SIAM J. Sci. Comput. 11(4): 804-809 (1990) - [j3]Nicholas J. Higham
:
Exploiting fast matrix multiplication within the level 3 BLAS. ACM Trans. Math. Softw. 16(4): 352-368 (1990)
1980 – 1989
- 1989
- [j2]Nicholas J. Higham
:
Algorithm 674: Fortran codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation. ACM Trans. Math. Softw. 15(2): 168 (1989) - 1988
- [j1]Nicholas J. Higham:
FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation. ACM Trans. Math. Softw. 14(4): 381-396 (1988)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint