Fixed-point computation refers to the process of computing an exact or approximate fixed point of a given function. In its most common form, the given...

contrasted to the more complicated and computationally demanding floating-point representation. In the fixed-point representation, the fraction is often...

In mathematics, a fixed point (sometimes shortened to fixpoint), also known as an invariant point, is a value that does not change under a given transformation...

Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after L. E. J. (Bertus) Brouwer. It states that for any continuous function f...

In combinatory logic for computer science, a fixed-point combinator (or fixpoint combinator),: p.26  is a higher-order function (i.e. a function which...

In numerical analysis, fixed-point iteration is a method of computing fixed points of a function. More specifically, given a function f {\displaystyle...

In mathematics, the Banach fixed-point theorem (also known as the contraction mapping theorem or contractive mapping theorem or Banach–Caccioppoli theorem)...

the number of queries is given. List of root finding algorithms Fixed-point computation Broyden's method – Quasi-Newton root-finding method for the multivariable...

search. On the other hand, determining whether a given fixed point is unique is computationally hard: For d=2, for componentwise lattice and a value-oracle...

In computing, floating-point arithmetic (FP) is arithmetic that represents subsets of real numbers using an integer with a fixed precision, called the...

Floating-point error mitigation is the minimization of errors caused by the fact that real numbers cannot, in general, be accurately represented in a fixed space...

that can compute with exact real numbers instead of the binary fixed point or floating point numbers used by most actual computers. The real RAM was formulated...

theory, the Kleene fixed-point theorem, named after American mathematician Stephen Cole Kleene, states the following: Kleene Fixed-Point Theorem. Suppose...

{\displaystyle f} is computationally expensive. Anderson acceleration is a method to accelerate the convergence of the fixed-point sequence. Define the...

point operations per second (FLOPS, flops or flop/s) is a measure of computer performance in computing, useful in fields of scientific computations that...

In mathematical logic, fixed-point logics are extensions of classical predicate logic that have been introduced to express recursion. Their development...

which object a query ray intersects first. If the search space is fixed, the computational complexity for this class of problems is usually estimated by:...

mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation, using an algorithm, how efficiently...

The International Fixed Calendar (also known as the Cotsworth plan, the Cotsworth calendar, the Eastman plan or the Yearal) was a proposed reform of the...

fixed-point free. The fixed-point theorem shows that no total computable function is fixed-point free, but there are many non-computable fixed-point-free...

The usual numbers systems used in numerical computation are floating point numbers and integers of a fixed bounded size. Neither of these is convenient...

In computational geometry, the point-in-polygon (PIP) problem asks whether a given point in the plane lies inside, outside, or on the boundary of a polygon...

Secure multi-party computation (also known as secure computation, multi-party computation (MPC) or privacy-preserving computation) is a subfield of cryptography...

representation of a number is fixed (fixed-point, floating-point and interval arithmetic), the main concern is the control the computational error, as far as possible;...

Automatic Computation (1st ed.). New Jersey, USA: Prentice-Hall, Englewood Cliffs. ISBN 0-13-165779-8. Sterbenz, Pat H. (1974-05-01). Floating-Point Computation...

The following tables list the computational complexity of various algorithms for common mathematical operations. Here, complexity refers to the time complexity...

1010 (~6 + 1). Note that while the number of binary bits is fixed throughout a computation it is otherwise arbitrary. Unlike the ones' complement scheme...

available for arbitrary-precision integer and floating-point math. Rather than storing values as a fixed number of bits related to the size of the processor...

computation, scientific computing, and system programming. It supports recursion, structured programming, linked data structure handling, fixed-point...

In astronomy, the fixed stars (Latin: stellae fixae) are the luminary points, mainly stars, that appear not to move relative to one another against the...