1998
DOI: 10.1002/(sici)1099-1506(199801/02)5:1<11::aid-nla123>3.3.co;2-6
|Get access via publisher |Summarize |Cite
|
Sign up to set email alerts

A parallel multisplitting solution of the least squares problem

Search citation statements

Order By: Relevance

Paper Sections

Select...
11
5
0
0

Citation Types

0
25
0
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
5
5
3

Relationship

0
13

Authors

Journals

citations

Cited by 13 publications

(25 citation statements)
references

References 0 publications

0
25
0
0
Order By: Relevance
How this paper cites the one you are viewing
“…Finally, by solving (17) according to (4), we obtain the mean and variance set (x c k , vc k ) that corresponds to (14). After obtaining these marginals, the last step includes defining messages from variable nodes X tie c k to factor nodes F tie .…”
Section: Distributed Weighted Least-squares Methods
mentioning
confidence: 99%
“…where xs and vs are obtained by solving (17). The mean z fi→xs and variance v fi→xs are calculated as defined in (11).…”
Section: Distributed Weighted Least-squares Methods
mentioning
confidence: 99%
“…In every iteration, all clusters are updated (line 13) and WLS is computed over the clusters (line 14). Next, means and variances from tie variable nodes to tie factor nodes are calculated using the GBP (lines [15][16][17][18]. Upon the completion of previous lines, all means and variances from tie factor nodes to tie variable nodes can be calculated (lines [20][21][22][23][24][25].…”
Section: A Vanilla Distributed Wls Algorithm
mentioning
confidence: 99%
“…In the next subsection, we propose different approach to solve the system of linear equations (17), alternative to solving the system in each iteration from the scratch (line 14). Note that for the system defined in (17), only vectors s c k and q c k dynamically change their values through iterations according to messages from tie factor nodes to tie variable nodes.…”
Section: A Vanilla Distributed Wls Algorithm
mentioning
confidence: 99%
See 3 more Smart Citations
How this paper cites the one you are viewing
“…Finally, by solving (17) according to (4), we obtain the mean and variance set (x c k , vc k ) that corresponds to (14). After obtaining these marginals, the last step includes defining messages from variable nodes X tie c k to factor nodes F tie .…”
Section: Distributed Weighted Least-squares Methods
mentioning
confidence: 99%
“…where xs and vs are obtained by solving (17). The mean z fi→xs and variance v fi→xs are calculated as defined in (11).…”
Section: Distributed Weighted Least-squares Methods
mentioning
confidence: 99%
“…In every iteration, all clusters are updated (line 13) and WLS is computed over the clusters (line 14). Next, means and variances from tie variable nodes to tie factor nodes are calculated using the GBP (lines [15][16][17][18]. Upon the completion of previous lines, all means and variances from tie factor nodes to tie variable nodes can be calculated (lines [20][21][22][23][24][25].…”
Section: A Vanilla Distributed Wls Algorithm
mentioning
confidence: 99%
“…In the next subsection, we propose different approach to solve the system of linear equations (17), alternative to solving the system in each iteration from the scratch (line 14). Note that for the system defined in (17), only vectors s c k and q c k dynamically change their values through iterations according to messages from tie factor nodes to tie variable nodes.…”
Section: A Vanilla Distributed Wls Algorithm
mentioning
confidence: 99%
See 2 more Smart Citations
How this paper cites the one you are viewing
“…wherex s andv s are obtained by solving (17). The mean z fi→xs and variance v fi→xs are calculated as defined in (11).…”
Section: Distributed Weighted Least-squares Methods
mentioning
confidence: 99%