1973
DOI: 10.1090/s0002-9939-1973-0309961-6
|View full text |Cite
|
Sign up to set email alerts
|

Matrices with prescribed entries and eigenvalues. I

Abstract: It is proved that there exists a matrix (over an appropriate field) with prescribed eigenvalues and a prescribed nonprincipal diagonal. It is also proved that there exists an n x n matrix, over an arbitrary field, with prescribed eigenvalues and with n-\ prescribed arbitrary entries.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

1975
1975
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 26 publications
(9 citation statements)
references
References 8 publications
0
9
0
Order By: Relevance
“…4 The challenge in Netflix recommendation system is a classic MC problem. 48 As the inspiration of Netflix Prize contest, many efficient low rank MC algorithms were developed, for instance, Opt-Space, 7 SVT, 5 CF, 9 BellKor, 10 PF, 11 and FWLS. 12 Eventually, the team BellKor’s Pragmatic Chaos won this contest.…”
Section: Methodsmentioning
confidence: 99%
“…4 The challenge in Netflix recommendation system is a classic MC problem. 48 As the inspiration of Netflix Prize contest, many efficient low rank MC algorithms were developed, for instance, Opt-Space, 7 SVT, 5 CF, 9 BellKor, 10 PF, 11 and FWLS. 12 Eventually, the team BellKor’s Pragmatic Chaos won this contest.…”
Section: Methodsmentioning
confidence: 99%
“…In the cycle of three papers [29,30,31], de Oliveira proved that ~l~e completion problem with I,cl = n (n > 2) is solvable over any field K; in this case, in the two situations described above, the necessary conditions indicated there are assumed to be fulfilled. For n = 2, in the general case, the algebraic closedness of the field K is necessary for the solvability of the problem.…”
Section: Completion Problems Of the General Type With Prescribed Eigementioning
confidence: 99%
“…Subcase 1.4.5 Suppose that we prescribe one entry in (6) and another in (9). This subcase is similar to Subcase 1.4.4.…”
Section: Prescribed Entries 363mentioning
confidence: 99%
“…According to the induction assumption, Co is similar to a matrix Do = [di,j] that satisfies (4). Then B is similar to a matrix of the form (5) and A = TI?-] T::~~',-~~~~-~~-~ TA-,,, (D) has the prescribed form.Subcase 1.3.3 Suppose that we prescribe either two distinct entries in(6) or two distinct entries in (7). W.l.o.g., suppose that (in-2, jn-2) = (n-1, s) and (in-1, j n V l ) = (n-I, t), where s, t E (1,. .…”
mentioning
confidence: 99%