TOPICS
Search

Search Results for ""


341 - 350 of 1788 for Finite_difference_methodSearch Results
The Lemoine hexagon is a cyclic hexagon with vertices given by the six concyclic intersections of the parallels of a reference triangle through its symmedian point K. The ...
A Lucas cube graph of order n is a graph that can be defined based on the n-Fibonacci cube graph by forbidding vertex strings that have a 1 both in the first and last ...
1. Find a complete system of invariants, or 2. Decide when two metrics differ only by a coordinate transformation. The most common statement of the problem is, "Given metrics ...
The middle layer graph of order n is the graph whose vertex set consists of all bitstrings of length 2n+1 that have exactly n or n+1 entries equal to 1, with an edge between ...
A transposition graph G_n is a graph whose nodes correspond to permutations and edges to permutations that differ by exactly one transposition (Skiena 1990, p. 9, Clark ...
Relaxation methods are methods of solving partial differential equations that involve splitting the sparse matrix that arises from finite differencing then iterating until a ...
Euler's series transformation is a transformation that sometimes accelerates the rate of convergence for an alternating series. Given a convergent alternating series with sum ...
Codimension is a term used in a number of algebraic and geometric contexts to indicate the difference between the dimension of certain objects and the dimension of a smaller ...
There are two similar but distinct concepts related to equidecomposability: "equidecomposable" and "equidecomposable by dissection." The difference is in that the pieces ...
Let rho be a reciprocal difference. Then Thiele's interpolation formula is the continued fraction f(x)=f(x_1)+(x-x_1)/(rho(x_1,x_2)+)(x-x_2)/(rho_2(x_1,x_2,x_3)-f(x_1)+) ...
1 ... 32|33|34|35|36|37|38 ... 179 Previous Next

...