Results 51 to 60 of about 24,909,697 (184)
A generalization of the method of averages for overdetermined linear systems [PDF]
Mathematics of Computation, 1975 Necessary and sufficient conditions are established for an existence and uniqueness result for a generalization of the method of averages for overdetermined linear systems. Some practical schemes are given, and a connection with Galerkin’s method is indicated.
openaire +1 more source
, 2018 This paper concerns with the developing the most general schemes so-called Fuzzy General Linear Methods (FGLM) for solving fuzzy differential equations. The general linear methods (GLM) for ordinary differential equations are the middle state of two extreme extensions (linear multistep and Runge-Kutta methods) of the one step Euler method.
Farzi, Javad, Moradi, Afsaneh
openaire +2 more sources
, 2008 General linear methods were originally introduced as a platform for the unified study of consistency, stability and convergence for a large class of numerical methods for ordinary differential equations.
Abraham Ochoche
core
Truncated low-rank methods for solving general linear matrix equations
This work is concerned with the numerical solution of large-scale linear matrix equations A1XB1T++AKXBKT=C. The most straightforward approach computes XRmxn from the solution of an mn x mn linear system, typically limiting the feasible values of m,n to a
Kressner, Daniel, Sirkovic, Petar
core +1 more source
Matrix rank/inertia formulas for least-squares solutions with statistical applications
Special Matrices, 2016 Least-Squares Solution (LSS) of a linear matrix equation and Ordinary Least-Squares Estimator (OLSE) of unknown parameters in a general linear model are two standard algebraical methods in computational mathematics and regression analysis.
Tian Yongge, Jiang Bo
doaj +1 more source
A general Phase-I method in linear programming [PDF]
European Journal of Operational Research, 1986 Phase I of the simplex method finds a basic feasible solution to linear programming (LP) problems. Phase I procedures can also be used for generating feasible points of other problems with linear constraints, or even for checking the consistency of a system of linear equalities/\(inequalities.\) The traditional phase I methods work under the following ...
openaire +2 more sources
Beyond Newtonian Thinking- Towards a Non-linear Archaeology - Applying Chaos Theory to Archaeology
Current Swedish Archaeology, 1997 In this article the authors suggest that chaos theory can provide us with a new perspective on archaeology. Newtonian thinking is predominant in archaeology, as well as in the humanities in general. This results in the hegemony of analytic methods and a
Henrik Gerding, Dominic Ingemark
doaj +1 more source
Bayesian inference for Poisson and multinomial log-linear models [PDF]
, 2009 Categorical data frequently arise in applications in the social sciences. In such applications,the class of log-linear models, based on either a Poisson or (product) multinomial response distribution, is a flexible model class for inference and ...
Forster, Jonathan J.
core +2 more sources
Robust optimization model for uncertain multiobjective linear programs
Journal of Inequalities and Applications, 2018 In this paper, we consider the multiobjective linear programs where coefficients in the objective function belong to uncertainty sets. We introduce the concept of robust efficient solutions to uncertain multiobjective linear programming problems.
Lei Wang, Min Fang
doaj +1 more source
Voting over piece-wise linear tax methods [PDF]
We analyze the problem of choosing the most appropriate method for apportioning taxes in a democracy. We consider a simple theoretical model of taxation and restrict our attention to piece-wise linear tax methods, which are almost ubiquitous in advanced ...
MORENO-TERNERO, Juan D.
core