• No results found

An Improved Algorithm for Discrete L1 Linear Approximation

N/A
N/A
Protected

Academic year: 2021

Share "An Improved Algorithm for Discrete L1 Linear Approximation"

Copied!
32
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)

Citation for this paper:

Barrodale, I. & Roberts, F.D.K. (1972). An Improved Algorithm for Discrete L1 Linear Approximation. MRC Technical Summary Report #1172.

UVicSPACE: Research & Learning Repository

_____________________________________________________________

Faculty of Engineering

Faculty Publications

_____________________________________________________________

An Improved Algorithm for Discrete L1 Linear Approximation Ian Barrodale and F.D.K. Roberts

MRC Technical Summary Report #1172 January 1972

A revised version of this internal report was later published in Society for Industrial and Applied Mathematics (SIAM) Journal on Numerical Analysis:

October 1973, 10(5), 839–848.

https://epubs.siam.org/doi/abs/10.1137/0710069

and its Fortran Subroutine was later published in Communications of the ACM, as Algorithm 478:

June 1974, 17(6), 319-320.

(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
(11)
(12)
(13)
(14)
(15)
(16)
(17)
(18)
(19)
(20)
(21)
(22)
(23)
(24)
(25)
(26)
(27)
(28)
(29)
(30)
(31)
(32)

Referenties

GERELATEERDE DOCUMENTEN

Section 2 contains the model by Dodge and Romig, section 3 shows the error in it and section 4 contains the revised version of the model. Finally section 5 discusses the

The answer to the last sub-question ”How does decomposition in linear systems affect the over approximation?” is that a higher over approximation during reachability analysis occurs

In this paper we derived explicit optimal portfolio rules in single-period and multiple-period investment environments using the risk measure of expected squared semi-deviation from

Section 2 lists the contributions of this paper; Section 3.1 briefly describes the IDEA cipher and its internal structure; Section 3.2 briefly recalls the definition of Shannon

In Section 3, we investigate the dimension and trivial facets of the 2ULS polytope, derive some properties of its facet defining inequalities, present a UFL model, project it onto

From the results in table 4 we conclude that this is due to the fact that for large densities a small number of new entries is fixed in each iteration of the projection operation..

Quest for urban design : design for a city image for the railway zone near the town centre of Eindhoven, The Netherlands on the occasion of the 24th EAAE congress from 22-25

Quest for urban design : design for a city image for the railway zone near the town centre of Eindhoven, The Netherlands on the occasion of the 24th EAAE congress from 22-25