Repository navigation
Expand file tree
/
Copy patht.html
More file actions
52 lines (43 loc) · 1.51 KB
/
Copy patht.html
File metadata and controls
52 lines (43 loc) · 1.51 KB
1
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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
<table>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="slra-agcd">1</a>]
</td>
<td class="bibtexitem">
K. Usevich and I. Markovsky.
Variable projection methods for approximate (greatest) common divisor
computations.
Technical report, Vrije Univ. Brussel, 2013.
[ <a href="t_bib.html#slra-agcd">bib</a> |
<a href="http://arxiv.org/pdf/1304.6962v1">pdf</a> |
<a href="http://arxiv.org/abs/1304.6962">http</a> |
<a href="t_abstracts.html#slra-agcd">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="rslra">2</a>]
</td>
<td class="bibtexitem">
M. Ishteva, K. Usevich, and I. Markovsky.
Regularized structured low-rank approximation.
Technical report, Vrije Univ. Brussel, 2013.
Submitted on 02/08/2013 to <em>SIAM J. Matrix Anal. Appl.</em>
[ <a href="t_bib.html#rslra">bib</a> |
<a href="http://homepages.vub.ac.be/~imarkovs/publications/rslra.pdf">pdf</a> |
<a href="t_abstracts.html#rslra">Abstract</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="rtls">3</a>]
</td>
<td class="bibtexitem">
S. Rhode, K. Usevich, I. Markovsky, and F. Gauterin.
A recursive restricted total least-squares algorithm.
Technical report, Vrije Univ. Brussel, 2013.
[ <a href="t_bib.html#rtls">bib</a> ]
</td>
</tr>
</table><hr><p><em>This file was generated by
<a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.97.</em></p>