When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Boundary value problem - Wikipedia

    en.wikipedia.org/wiki/Boundary_value_problem

    Boundary value problems are similar to initial value problems.A boundary value problem has conditions specified at the extremes ("boundaries") of the independent variable in the equation whereas an initial value problem has all of the conditions specified at the same value of the independent variable (and that value is at the lower boundary of the domain, thus the term "initial" value).

  3. Initial value problem - Wikipedia

    en.wikipedia.org/wiki/Initial_value_problem

    The Banach fixed point theorem is then invoked to show that there exists a unique fixed point, which is the solution of the initial value problem. An older proof of the Picard–Lindelöf theorem constructs a sequence of functions which converge to the solution of the integral equation, and thus, the solution of the initial value problem.

  4. P versus NP problem - Wikipedia

    en.wikipedia.org/wiki/P_versus_NP_problem

    In this theory, the class P consists of all decision problems (defined below) solvable on a deterministic sequential machine in a duration polynomial in the size of the input; the class NP consists of all decision problems whose positive solutions are verifiable in polynomial time given the right information, or equivalently, whose solution can ...

  5. The Feynman Lectures on Physics - Wikipedia

    en.wikipedia.org/.../The_Feynman_Lectures_on_Physics

    Addison-Wesley published a collection of exercises and problems to accompany The Feynman Lectures on Physics. The problem sets were first used in the 1962–1963 academic year, and were organized by Robert B. Leighton. Some of the problems are sophisticated and difficult enough to require an understanding of advanced topics, such as Kolmogorov ...

  6. Iterative method - Wikipedia

    en.wikipedia.org/wiki/Iterative_method

    If an equation can be put into the form f(x) = x, and a solution x is an attractive fixed point of the function f, then one may begin with a point x 1 in the basin of attraction of x, and let x n+1 = f(x n) for n ≥ 1, and the sequence {x n} n ≥ 1 will converge to the solution x.

  7. Combinatorial optimization - Wikipedia

    en.wikipedia.org/wiki/Combinatorial_optimization

    A minimum spanning tree of a weighted planar graph.Finding a minimum spanning tree is a common problem involving combinatorial optimization. Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, [1] where the set of feasible solutions is discrete or can be reduced to a discrete set.

  8. Hamiltonian mechanics - Wikipedia

    en.wikipedia.org/wiki/Hamiltonian_mechanics

    The solutions to the Hamilton–Jacobi equations for this Hamiltonian are then the same as the geodesics on the manifold. In particular, the Hamiltonian flow in this case is the same thing as the geodesic flow. The existence of such solutions, and the completeness of the set of solutions, are discussed in detail in the article on geodesics.

  9. Transmission line - Wikipedia

    en.wikipedia.org/wiki/Transmission_line

    These are wave equations which have plane waves with equal propagation speed in the forward and reverse directions as solutions. The physical significance of this is that electromagnetic waves propagate down transmission lines and in general, there is a reflected component that interferes with the original signal.