A Fast Algorithm for Solving Henderson's Mixed Model Equation

10/26/2017
by   Jiwoong Kim, et al.
0

This article investigates a fast and stable method to solve Henderson's mixed model equation. The proposed algorithm is stable in that it avoids inverting a matrix of a large dimension and hence is free from the curse of dimensionality. This tactic is enabled through row operations performed on the design matrix.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/26/2023

Kaczmarz-Type Method for Solving Matrix Equation AXB=C

In this paper, several row and column orthogonal projection methods are ...
research
09/18/2017

A Fast Algorithm Based on a Sylvester-like Equation for LS Regression with GMRF Prior

This paper presents a fast approach for penalized least squares (LS) reg...
research
07/22/2020

Exploiting No-Regret Algorithms in System Design

We investigate a repeated two-player zero-sum game setting where the col...
research
11/17/2017

Solving Poisson's Equation on the Microsoft HoloLens

We present a mixed reality application (HoloFEM) for the Microsoft HoloL...
research
08/19/2016

Solving a Mixture of Many Random Linear Equations by Tensor Decomposition and Alternating Minimization

We consider the problem of solving mixed random linear equations with k ...
research
10/24/2022

Learned Lifted Linearization Applied to Unstable Dynamic Systems Enabled by Koopman Direct Encoding

This paper presents a Koopman lifting linearization method that is appli...
research
07/06/2020

A Weighted Randomized Kaczmarz Method for Solving Linear Systems

The Kaczmarz method for solving a linear system Ax = b interprets such a...

Please sign up or login with your details

Forgot password? Click here to reset