Search references for GENERAL LINEAR-METHODS. Phrases containing GENERAL LINEAR-METHODS
See searches and references containing GENERAL LINEAR-METHODS!GENERAL LINEAR-METHODS
Class of numerical method to solve differential equations
General linear methods (GLMs) are a large class of numerical methods used to obtain numerical solutions to ordinary differential equations. They include
General_linear_methods
Method to solve optimization problems
Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical
Linear_programming
Family of implicit and explicit iterative methods
Runge–Kutta methods (English: /ˈrʊŋəˈkʊtɑː/ RUUNG-ə-KUUT-tah) are a family of explicit and implicit iterative methods, which include the Euler method, used
Runge–Kutta_methods
Optimization technique for solving (mixed) integer linear programs
cutting-plane method is any of a variety of optimization methods that iteratively refine a feasible set or objective function by means of linear inequalities
Cutting-plane_method
Statistical linear model
The general linear model or general multivariate regression model is a compact way of simultaneously writing several multiple linear regression models
General_linear_model
Class of statistical models
generalized linear model (GLM) is a flexible generalization of ordinary linear regression. The GLM generalizes linear regression by allowing the linear model
Generalized_linear_model
Approximation of a function by its tangent line at a point
In mathematics, a linear approximation is an approximation of a general function using a linear function (more precisely, an affine function). They are
Linear_approximation
Methods used to find numerical solutions of ordinary differential equations
schemes. The so-called general linear methods (GLMs) are a generalization of the above two large classes of methods. Euler's method can be thought of as
Numerical methods for ordinary differential equations
Numerical_methods_for_ordinary_differential_equations
Numerical approximation algorithm
of linear equations, the two main classes of iterative methods are the stationary iterative methods, and the more general Krylov subspace methods. Stationary
Iterative_method
Algorithms for solving convex optimization problems
Interior-point methods (also referred to as barrier methods or IPMs) are algorithms for solving linear and non-linear convex optimization problems. IPMs
Interior-point_method
Numerical methods for linear least squares entails the numerical analysis of linear least squares problems. A general approach to the least squares problem
Numerical methods for linear least squares
Numerical_methods_for_linear_least_squares
Several equations of degree 1 to be solved simultaneously
In mathematics, a system of linear equations (or linear system) is a collection of two or more linear equations involving the same variables. For example
System_of_linear_equations
Differential equation that is linear with respect to the unknown function
a linear equation of order one, with non-constant coefficients. An equation of order two or higher with non-constant coefficients cannot, in general, be
Linear_differential_equation
Algorithm for linear programming
mathematical optimization, Dantzig's simplex algorithm (or simplex method) is an algorithm for linear programming. The name of the algorithm is derived from the
Simplex_algorithm
Iterative solving method
computation. In linear systems, the two main classes of relaxation methods are stationary iterative methods, and the more general Krylov subspace methods. The Jacobi
Relaxation_(iterative_method)
New Zealand mathematician
and general linear methods. The Butcher group and the Butcher tableau are named after him. More recently, he is investigating a new type of method with
John_C._Butcher
Numerical method for differential equations
In numerical analysis, the local linearization (LL) method is a general strategy for designing numerical integrators for differential equations based on
Local_linearization_method
Iterative method for minimizing convex functions
function. When specialized to solving feasible linear optimization problems with rational data, the ellipsoid method is an algorithm which finds an optimal solution
Ellipsoid_method
Regularization technique for ill-posed problems
used method of regularization of ill-posed problem inverse problems. It is particularly useful to mitigate the problem of multicollinearity in linear regression
Ridge_regression
Procedure for solving differential equations
of constants, is a general method to solve inhomogeneous linear ordinary differential equations. For first-order inhomogeneous linear differential equations
Variation_of_parameters
Class of algorithms for solving constrained optimization problems
Lagrangian methods are a certain class of algorithms for solving constrained optimization problems. They have similarities to penalty methods in that they
Augmented_Lagrangian_method
Solution process for some optimization problems
convex and general methods from convex optimization can be used in most cases. If the objective function is quadratic and the constraints are linear, quadratic
Nonlinear_programming
Subfield of mathematical optimization
subgradient methods are subgradient methods applied to a dual problem. The drift-plus-penalty method is similar to the dual subgradient method, but takes
Convex_optimization
Method of curve fitting
In mathematics, linear interpolation is a method of function approximation using linear polynomials to construct new data points within the range of a
Linear_interpolation
Methods in numerical computation
Rosenbrock methods refers to either of two distinct ideas in numerical computation, both named for Howard H. Rosenbrock. Rosenbrock methods for stiff differential
Rosenbrock_methods
Class of numerical methods
integrators are often combined with Krylov subspace projection methods. General linear methods Certaine (1960) Pope (1963) Hochbruck & Ostermann (2010) Hochbruck
Exponential_integrator
Least squares approximation of linear functions to data
in linear regression, including variants for ordinary (unweighted), weighted, and generalized (correlated) residuals. Numerical methods for linear least
Linear_least_squares
Optimization algorithm
and the method has linear convergence with rate 1/φ≈0.618. This ratio is optimal among the zero-order methods. Zero-order methods are very general – they
Line_search
Class of numerical techniques
difference methods convert ordinary differential equations (ODE) or partial differential equations (PDE), which may be nonlinear, into a system of linear equations
Finite_difference_method
Algorithm for generating pseudo-randomized numbers
pseudo-randomized numbers calculated with a discontinuous piecewise linear equation. The method represents one of the oldest and best-known pseudorandom number
Linear_congruential_generator
Method for estimating new data outside known data points
extrapolation methods. Crucial questions are, for example, if the data can be assumed to be continuous, smooth, possibly periodic, etc. Linear extrapolation
Extrapolation
Mathematical optimization problem restricted to integers
integer linear programs exactly. One class of algorithms are cutting plane methods, which work by solving the LP relaxation and then adding linear constraints
Integer_programming
Method of solving linear programming problems
operations research, the Big M method is a method of solving linear programming problems using the simplex algorithm. The Big M method extends the simplex algorithm
Big_M_method
Type of differential equation
these methods greater flexibility and solution generality. The three most widely used numerical methods to solve PDEs are the finite element method (FEM)
Partial_differential_equation
Approach to finding numerical solutions of ordinary differential equations
List of Runge–Kutta methods Linear multistep method Numerical integration (for calculating definite integrals) Numerical methods for ordinary differential
Euler_method
Finding linear approximation of function at given point
mathematics, linearization (British English: linearisation) is finding the linear approximation to a function at a given point. The linear approximation
Linearization
Numerical method for solving physical or engineering problems
arise in the steady-state problems are solved using numerical linear algebraic methods. In contrast, ordinary differential equation sets that occur in
Finite_element_method
Optimization algorithm
of linear equations and is often quite costly. In contrast, quasi-Newton methods usually generate an estimate of B−1 directly. As in Newton's method, one
Quasi-Newton_method
Type of algorithm for constrained optimization
optimization, penalty methods are a certain class of algorithms for solving constrained optimization problems. A penalty method replaces a constrained
Penalty_method
one to increase accuracy General linear methods — a class of methods encapsulating linear multistep and Runge-Kutta methods Bulirsch–Stoer algorithm —
List of numerical analysis topics
List_of_numerical_analysis_topics
Algorithm for finding zeros of functions
algorithm is first in the class of Householder's methods, and was succeeded by Halley's method. The method can also be extended to complex functions and
Newton's_method
Class of algorithms for pattern analysis
These methods involve using linear classifiers to solve nonlinear problems. The general task of pattern analysis is to find and study general types of
Kernel_method
Subfield of convex optimization
linear matrix inequalities. SDPs are in fact a special case of cone programming and can be efficiently solved by interior point methods. All linear programs
Semidefinite_programming
Optimization algorithm
similar method in 1907. Its convergence properties for non-linear optimization problems were first studied by Haskell Curry in 1944, with the method becoming
Gradient_descent
Approximation method in statistics
the method is to approximate the model by a linear one and to refine the parameters by successive iterations. There are many similarities to linear least
Non-linear_least_squares
Approximation for nonlinear optimization
Successive Linear Programming (SLP), also known as Sequential Linear Programming, is an optimization technique for approximately solving nonlinear optimization
Successive_linear_programming
Concept in mathematics
In numerical linear algebra, the biconjugate gradient stabilized method, often abbreviated as BiCGSTAB, is an iterative method developed by H. A. van
Biconjugate gradient stabilized method
Biconjugate_gradient_stabilized_method
Optimization algorithm
Frank–Wolfe algorithm considers a linear approximation of the objective function, and moves towards a minimizer of this linear function (taken over the same
Frank–Wolfe_algorithm
Approximation method in statistics
In numerical linear algebra and regression analysis, least squares is a method to determine the best-fit model by minimizing the sum of the squared residuals—the
Least_squares
Determinant of the matrix of first derivatives of a set of functions
functions are linearly dependent. Wolsson (1989a) gave a more general condition that together with the vanishing of the Wronskian implies linear dependence
Wronskian
Optimization algorithm
represent the approximation implicitly. Due to its resulting linear memory requirement, the L-BFGS method is particularly well suited for optimization problems
Limited-memory_BFGS
Root-finding algorithm
method exist. Halley's method exactly finds the roots of a linear-over-linear Padé approximation to the function. This contrasts with Newton's method
Halley's_method
Topics referred to by the same term
appear linearly. Linear regression may also refer to: The ordinary least squares method, one of the most popular methods for estimating a linear regression
Linear regression (disambiguation)
Linear_regression_(disambiguation)
Differential equation containing derivatives with respect to only one variable
inhomogeneous) A linear differential equation is nonhomogeneous if r(x)≠0. Non-linear A differential equation that is not linear. A linear differential equation
Ordinary differential equation
Ordinary_differential_equation
Numerical optimization algorithm
Press. ISBN 978-0-521-88068-8. Nash, J. C. (1979). Compact Numerical Methods: Linear Algebra and Function Minimisation. Bristol: Adam Hilger. ISBN 978-0-85274-330-0
Nelder–Mead_method
Optimization method
Practical Methods of Optimization (2nd ed.), New York: John Wiley & Sons, ISBN 978-0-471-91547-8 Luenberger, David G.; Ye, Yinyu (2008), Linear and nonlinear
Broyden–Fletcher–Goldfarb–Shanno algorithm
Broyden–Fletcher–Goldfarb–Shanno_algorithm
Method of solution for inhomogeneous ODEs
}} constants). The method consists of finding the general homogeneous solution y c {\displaystyle y_{c}} for the complementary linear homogeneous differential
Method of undetermined coefficients
Method_of_undetermined_coefficients
Statistical model
statistics, a generalized linear mixed model (GLMM) is an extension to the generalized linear model (GLM) in which the linear predictor contains random
Generalized linear mixed model
Generalized_linear_mixed_model
Solving an optimization problem with a quadratic objective function
optimize (minimize or maximize) a multivariate quadratic function subject to linear constraints on the variables. Quadratic programming is a type of nonlinear
Quadratic_programming
Combinatorial optimization method
Branch and cut is a method of combinatorial optimization for solving integer linear programs (ILPs), that is, linear programming (LP) problems where some
Branch_and_cut
Linear programming algorithm
the revised simplex method is a variant of George Dantzig's simplex method for linear programming. The revised simplex method is mathematically equivalent
Revised_simplex_method
Algorithm used to solve non-linear least squares problems
or just LM), also known as the damped least-squares (DLS) method, is used to solve non-linear least squares problems. These minimization problems arise
Levenberg–Marquardt_algorithm
function at the current point.[clarification needed] Examples of gradient methods are the gradient descent and the conjugate gradient. Gradient descent Stochastic
Gradient_method
Method for numerical differential equations
discretisation method (GDM) is a framework which contains classical and recent numerical schemes for diffusion problems of various kinds: linear or non-linear, steady-state
Gradient discretisation method
Gradient_discretisation_method
Method for solving continuous operator problems (such as differential equations)
In mathematics, in the area of numerical analysis, Galerkin methods are a family of methods for converting a continuous operator problem, such as a differential
Galerkin_method
Linear perturbations to solutions of nonlinear Einstein field equations
In the theory of general relativity, linearized gravity is the application of perturbation theory to the metric tensor that describes the geometry of spacetime
Linearized_gravity
Linear regression model with a single explanatory variable
In statistics, simple linear regression (SLR) is a linear regression model with a single explanatory variable. That is, it concerns two-dimensional sample
Simple_linear_regression
Statistical modeling method
independent variable) related via a linear combination. A linear model with exactly one explanatory variable is a simple linear regression; a model with two
Linear_regression
Field of mathematics
means that most methods for computing the singular value decomposition are similar to eigenvalue methods; perhaps the most common method involves Householder
Numerical_linear_algebra
Mathematical optimization method
gradient (CG) methods, finding CG tending faster for linear problems, but BB often faster for non-linear problems versus applicable CG-based methods. BB has
Barzilai–Borwein_method
framework for time-stepping partial differential equations (PDEs): general linear methods, object-oriented implementation and application to fluid problems"
Nektar++
Optimization algorithm
finding good paths through graphs. Artificial ants represent multi-agent methods inspired by the behavior of real ants. The pheromone-based communication
Ant colony optimization algorithms
Ant_colony_optimization_algorithms
gradient method without the agonizing pain." (1994) Saad, Y. (2003). "Chapter 6: Krylov Subspace Methods, Part I". Iterative methods for sparse linear systems
Derivation of the conjugate gradient method
Derivation_of_the_conjugate_gradient_method
Moving average and polynomial regression method for smoothing data
years before LOESS). LOESS and LOWESS thus build on "classical" methods, such as linear and nonlinear least squares regression. They address situations
Local_regression
Term in mathematical optimization
reasonable approximation. Trust-region methods are in some sense dual to line-search methods: trust-region methods first choose a step size (the size of
Trust_region
Problem optimization method
nested recursively inside larger problems, so that dynamic programming methods are applicable, then there is a relation between the value of the larger
Dynamic_programming
Statistical method
Multiple linear regression is a special case, restricted to one dependent variable, of general linear models (also known as multivariate linear regression)
Multiple_linear_regression
Class of ordinary differential equations
a few decimal places. Shooting methods Finite difference method Spectral parameter power series method Shooting methods proceed by guessing a value of
Sturm–Liouville_theory
Actuator that creates motion in a straight line
A linear actuator is an actuator that creates linear motion (i.e., in a straight line), in contrast to the circular motion of a conventional electric motor
Linear_actuator
Optimization by removing non-optimal solutions to subproblems
between branch-and-bound and the cutting plane methods that is used extensively for solving integer linear programs. Evolutionary algorithm Alpha–beta pruning
Branch_and_bound
Optimization algorithm
SQP methods solve a sequence of optimization subproblems, each of which optimizes a quadratic model of the objective subject to a linearization of the
Sequential quadratic programming
Sequential_quadratic_programming
Algorithm for finding a local minimum of a function
in the linear searches along the search vectors, which can be achieved via Brent's method. Mathews, John H. "Module for Powell Search Method for a Minimum"
Powell's_method
Sequential model-based optimization of expensive black-box functions
numerical methods such as Newton's method and quasi-Newton methods like the Broyden–Fletcher–Goldfarb–Shanno algorithm. Stochastic methods are also used
Bayesian_optimization
Concept in mathematics
∇xf=2AT(Ax−b)=0. Whereas linear conjugate gradient seeks a solution to the linear equation ATAx=ATb, the nonlinear conjugate gradient method is generally used
Nonlinear conjugate gradient method
Nonlinear_conjugate_gradient_method
System where changes of output are not proportional to changes of input
such that at least one of them is not a linear equation. For a single equation of the form f(x)=0, many methods have been designed; see Root-finding algorithm
Nonlinear_system
Method for mathematical optimization
family of algorithms for linear programming. Variants of the criss-cross algorithm also solve more general problems with linear inequality constraints and
Criss-cross_algorithm
Method for numerical solution of certain systems of equations
residual method (GMRES) is an iterative method for the numerical solution of an indefinite nonsymmetric system of linear equations. The method approximates
Generalized minimal residual method
Generalized_minimal_residual_method
Branch of mathematics
linear equations, and computing their intersections amounts to solving systems of linear equations. The first systematic methods for solving linear systems
Linear_algebra
Subfield of mathematical optimization
discrete optimization. A considerable amount of it is unified by the theory of linear programming. Some examples of combinatorial optimization problems that are
Combinatorial_optimization
Solving multiple machine learning tasks at the same time
according to some general metric. Suppose, as developed more formally below, that the parameter vector modeling each task is a linear combination of some
Multi-task_learning
Concept in convex optimization mathematics
Subgradient methods are convex optimization methods which use subderivatives. Originally developed by Naum Z. Shor and others in the 1960s and 1970s,
Subgradient_method
Determining all voltages and currents within an electrical network
the techniques assume linear components. Except where stated, the methods described in this article are applicable only to linear network analysis. A useful
Network analysis (electrical circuits)
Network_analysis_(electrical_circuits)
Mathematical algorithm
coordinate descent has been shown competitive to other methods when applied to such problems as training linear support vector machines (see LIBLINEAR) and non-negative
Coordinate_descent
response and complex replacement, is a method used to find a particular solution of a non-homogeneous linear ordinary differential equation of any order
Exponential_response_formula
Mathematical algorithm for eliminating variables from a system of linear inequalities
elimination, also known as the FME method, is a mathematical algorithm for eliminating variables from a system of linear inequalities. It can output real
Fourier–Motzkin_elimination
Collective behavior of decentralized, self-organized systems
generate diagnoses with significantly higher accuracy than traditional methods. ASI has been used by the Food and Agriculture Organization (FAO) of the
Swarm_intelligence
Periodicity computation method
Least-squares spectral analysis (LSSA) is a class of methods for estimating a frequency spectrum by fitting sinusoids to data using a least-squares fit
Least-squares spectral analysis
Least-squares_spectral_analysis
Local search algorithm
Tabu search (TS) is a metaheuristic search method employing local search methods used for mathematical optimization. It was created by Fred W. Glover
Tabu_search
Method in numerical analysis
interaction of linear and nonlinear mechanisms makes it difficult to find general analytical solutions. However, the split-step method provides a numerical
Split-step_method
Method for estimating the unknown parameters in a linear regression model
ordinary least squares (OLS) is a type of linear least squares method for choosing the unknown parameters in a linear regression model by the principle of
Ordinary_least_squares
travel, tourism, insurance
GENERAL LINEAR-METHODS
GENERAL LINEAR-METHODS
GENERAL LINEAR-METHODS
GENERAL LINEAR-METHODS
GENERAL LINEAR-METHODS
GENERAL LINEAR-METHODS
GENERAL LINEAR-METHODS
GENERAL LINEAR-METHODS
GENERAL LINEAR-METHODS
travel, tourism, insurance