# Tag Info

## Hot answers tagged reference-request

Accepted

### What is the state of the art in solving stiff initial value problems?

So there is a ton to say about this, and we will actually be putting a paper out that tries to summarize it a bit, but let me narrow it down to something that can be put into a quick StackOverflow ...
• 11.4k

### Robust algorithm for $2 \times 2$ SVD

See https://math.stackexchange.com/questions/861674/decompose-a-2d-arbitrary-transform-into-only-scaling-and-rotation (sorry, I would have put that in a comment but I've registered just to post this ...
• 291

### Looking for Runge-Kutta 8th order in C/C++

If you're doing celestial mechanics over long time scales, using a classical Runge-Kutta integrator will not preserve energy. In that case, using a symplectic integrator would probably be better. ...
• 29.8k
Accepted

### Is it well known that some optimization problems are equivalent to time-stepping?

As Jed Brown mentioned, the connection between gradient descent in nonlinear optimization and time stepping of dynamical systems is rediscovered with some frequency (understandably, since it's a very ...
• 11.9k

### Fast explicit solution for $\mathbf{A}\mathbf{x} = \mathbf{b}$, $\mathbf{b} \in \mathbf{R}^3$, low condition number

You can't beat an explicit formula. You can write down the formulas for the solution $x=A^{-1}b$ on a piece of paper. Let the compiler optimize things for you. Any other method will almost inevitably ...
• 50.2k

### Is it well known that some optimization problems are equivalent to time-stepping?

While I haven't seen the exact formulation that you have written down here, I keep seeing talks in which people "rediscover" a connection to integrating some transient system, and proceed to write ...
• 25.2k
Accepted

### How to directly compute the inverse of an ill-conditioned dense matrix

Though it is a relatively rare situation when you actually have to calculate an inverse of the matrix, not all techniques were created equally. I would use the term badly-conditioned instead of ill-...
• 8,287

### Modern C++ in scientific computing?

Two examples of libraries that use modern C++ constructs: Both the eigen and armadillo libraries (linear algebra) use several modern C++ constructs. For instance, they use both expression templates ...
• 2,165
Accepted

### Benchmarks for Gröbner bases and polynomial system solution

I posted some benchmarks here: http://www.cecm.sfu.ca/~rpearcea/mgb.html (archived copy) These are for total degree orders. To solve systems you typically need to do more work. Timings are for a ...
• 236
Accepted

• 3,003

### Benchmarks for Gröbner bases and polynomial system solution

Googling benchmark polynomial systems leads to a few hits, including the University of Mannheim's Computer Algebra Benchmark Initiative. Sadly, most of these are ...
• 11.9k
Accepted

### First appearance of the phrase "inverse crime"

The term inverse crime for a numerical test of a parameter identification method that uses data contained in the range of the discrete(!) forward operator used for the inversion (thus essentially ...
• 11.9k
Accepted

### Consumer hardware for scientific computing?

One issue that you should be aware of is that NVIDIA has a market segmentation strategy in which it sells relatively inexpensive GPU's to the gaming and graphics workstation markets (GeForce and ...
• 17.6k
Accepted

### 4th order tensor rotation - sources to refer

There are two main ways to write stress/strain tensors as 6 components vectors: Voigt notation, that is the most common; and Mandel-Kelvin notation, that has the advantage of writing stress and ...
• 7,902
Accepted

### FEM for vector valued problems: reference request

Short answer: Just replicate the vector of interpolation functions into a block-diagonal matrix, as showed e.g. on page 5 in this lecture note. Detailed answer: Mathematically oriented texts typically ...
• 652
Accepted

### Books on mathematical foundation of finite element methods

I have to disagree with Paul: Functional analysis is a beautiful, elegant topic with an enormous range of applications (but de gustibus... :)). But in any case, you don't need to know a lot of (pure)...
• 11.9k

### Robust algorithm for $2 \times 2$ SVD

I needed an algorithm that has little branching (hopefully CMOVs) no trigonometric function calls high numerical accuracy even with 32 bit floats We want to calculate $c_1, s_1, c_2, s_2, \sigma_1$ ...
Accepted

### Finite elements on manifold

I think you start by looking at something like FEniCS. Marie Rognes has a presentation with code examples and a paper discussing the theory and implementation. libMesh is supposed to be able to do ...
• 29.8k

### Modern C++ in scientific computing?

The HPX library makes heavy use of a range of C++11 features such as move constructors and is also aiming to be a complete implementation of N4409 (Working Draft, Technical Specification for C++ ...
• 171
Accepted

### Term for the typical "linear in the larger dimension, quadratic in the smaller" cost for linear algebra

The book "Introduction to Applied Linear Algebra" by Boyd and Vandenberghe has an appendix about complexity of basic operations in linear algebra and they call this case big-times-small-...
• 1,728
Accepted

### The Formula of Explicit Runge-Kutta Fourteen order

The 14th order methods due to Feagin can be found in DifferentialEquations.jl. An example using them with 128-bit floating point arithmetic is as follows: ...
• 11.4k
Accepted

### Point inside curved finite element

I don't think you can do better in general than mapping to the reference element and testing there. If your mapping is somehow special, you might be able to develop a test that's more efficient than ...
• 10.8k