# Tagged Questions

Numerical algorithms for problems in analysis and algebra, scientific computation

0answers
73 views

### Global Approximation via Convex Combination of Local Approximations

I recently faced the problem of efficiently approximating a very large set of data points and, neither having a model of the empiric function, nor of the error distribution, my method of choice would ...
1answer
220 views

3answers
237 views

### Quadrature formula max accuracy

I'm looking for a maximum accuracy quadrature formula: $$\int_{-1} ^{1} \sqrt{\frac {1-x}{1+x}} f(x)dx = A_1f(x_1)+A_2f(x_2)+R(f)$$ I don't know exactly if it's Trapezoidal rule which has the ...
1answer
213 views

### Decompositions of sparse symmetric matrices and methods for solving large linear equations

I am writing code for solving linear equations of the form $$A_{n\times n}\cdot x=1_n$$ where $n$ is on the order of $10^6$ and $A$ is a symmetric matrix with approx $10^3$ nonzero entries in each ...
1answer
75 views

2answers
1k views

### Mathematical study of Mpemba effect?

It has been known since the days of Aristotle and Descartes that under certain circumstances warm water freezes faster than cold water. This effect is now commonly known as the Mpemba effect, named ...
1answer
194 views

1answer
289 views

1answer
92 views

### Quadrature rules exact for given functions

Many quadrature schemes are defined by the degree of polynomials for which they are exact. For example, we say that the rule SUM_i a_i f(x_i) is order n when SUM_i a_i p(x_i) = INT p(x) dx for all ...
1answer
349 views

### Convergence of fixed point iteration algorithm

It is obvious that for any given $f(x)$ there exists $g(x)$ such that $f(x)=0 \Leftrightarrow g(x)=x$. We could use this fact to solve any root finding problem using fixed point iteration method, only ...