User Brian Borchers

68 votes

Accepted

why is Av+Bv faster than (A+B)*v?

answered Jan 16, 2020 at 1:03

24 votes

Accepted

Scientific computing vs numerical analysis

answered Feb 12, 2017 at 3:59

23 votes

Accepted

Testing if a matrix is positive semi-definite

answered Jun 24, 2014 at 15:48

20 votes

Tikhonov regularization in the non-negative least square - NNLS (python:scipy)

answered Feb 1, 2014 at 16:31

19 votes

Accepted

Should I rent computing resources, or buy my own computers

answered May 31, 2015 at 7:08

19 votes

Row major versus Column major layout of matrices

answered Dec 1, 2012 at 22:53

19 votes

Accepted

What are the guidelines for conducting computational experiments?

answered Apr 25, 2018 at 22:25

18 votes

Rule of thumb for sparse vs dense matrix storage

answered Sep 15, 2018 at 2:55

17 votes

Is providing approximate gradients to a gradient based optimizer useless?

answered Jul 19, 2016 at 3:57

17 votes

Difference between Gauss-Newton method and quasi-Newton method for optimization

answered Oct 15, 2015 at 19:38

16 votes

Why does the numerical solution of an ODE move away from an unstable equilibrium?

answered Jun 21, 2019 at 4:00

15 votes

Time and memory required to diagonalize a 18000 by 18000 matrix using numpy in python

answered Mar 20 at 19:25

14 votes

Accepted

Increasing computational performance by using 16 bit numbers

answered Mar 9, 2020 at 22:10

14 votes

Accepted

Hardware performance, floating point functions

answered Dec 16, 2015 at 16:22

14 votes

Accepted

Solving linear systems by fft

answered May 15, 2013 at 23:02

14 votes

Computation Effort of Algorithms

answered Oct 6, 2013 at 16:42

13 votes

Confusion about compressed sensing problem

answered Apr 7, 2013 at 0:33

13 votes

Accepted

Solving a sparse and highly ill-conditioned system

answered Apr 27, 2013 at 20:43

13 votes

Accepted

Schur's Complement and Inverse of Block Matrices

answered Dec 20, 2012 at 18:15

13 votes

Accepted

Does the matrix condition number affect accuracy of iterative linear solvers?

answered Mar 6, 2015 at 20:00

13 votes

Why are higher-order Runge–Kutta methods not used more often?

answered Nov 17, 2016 at 17:39

13 votes

Accepted

How much more work is it to code math models in Python, compared to working with Matlab?

answered Jan 2, 2020 at 0:17

13 votes

Accepted

How Jacobian matrix helps optimization faster?

answered May 4, 2017 at 23:21

12 votes

What is the most efficient way to write 'for' loops in Matlab?

answered Jul 28, 2019 at 19:05

12 votes

Accepted

When and when not to use automatic differentiation

answered Jul 25, 2020 at 22:39

12 votes

cost function: why use power of two ? abs(x - xhat) / x better?

answered Oct 23, 2015 at 1:46

12 votes

Accepted

Why are interior point methods difficult to warm start?

answered Sep 13, 2013 at 4:30

12 votes

Global maximization of expensive objective function

answered Nov 17, 2013 at 15:38

12 votes

Accepted

Efficient computation of the matrix square root inverse

answered Dec 21, 2013 at 22:18

11 votes

Accepted

How is the SVD of a matrix computed in practice

answered Apr 25, 2013 at 19:56

Stack Exchange Network

304 Answers

why is Av+Bv faster than (A+B)*v?

Scientific computing vs numerical analysis

Testing if a matrix is positive semi-definite

Tikhonov regularization in the non-negative least square - NNLS (python:scipy)

Should I rent computing resources, or buy my own computers

Row major versus Column major layout of matrices

What are the guidelines for conducting computational experiments?

Rule of thumb for sparse vs dense matrix storage

Is providing approximate gradients to a gradient based optimizer useless?

Difference between Gauss-Newton method and quasi-Newton method for optimization

Why does the numerical solution of an ODE move away from an unstable equilibrium?

Time and memory required to diagonalize a 18000 by 18000 matrix using numpy in python

Increasing computational performance by using 16 bit numbers

Hardware performance, floating point functions

Solving linear systems by fft

Computation Effort of Algorithms

Confusion about compressed sensing problem

Solving a sparse and highly ill-conditioned system

Schur's Complement and Inverse of Block Matrices

Does the matrix condition number affect accuracy of iterative linear solvers?

Why are higher-order Runge–Kutta methods not used more often?

How much more work is it to code math models in Python, compared to working with Matlab?

How Jacobian matrix helps optimization faster?

What is the most efficient way to write 'for' loops in Matlab?

When and when not to use automatic differentiation

cost function: why use power of two ? abs(x - xhat) / x better?

Why are interior point methods difficult to warm start?

Global maximization of expensive objective function

Efficient computation of the matrix square root inverse

How is the SVD of a matrix computed in practice