default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFranklin T. Luk
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j22]Michael K. Ng
, Raymond H. Chan, Xiaojun Chen, Liqun Qi, Franklin T. Luk, Eugene Tyrtyshnikov:
Structured matrices and tensors. Numer. Linear Algebra Appl. 19(1): 1-2 (2012)- 2011
- [j21]Jaehyun Park, Joohwan Chun, Franklin T. Luk:
Lattice Reduction Aided MMSE Decision Feedback Equalizers. IEEE Trans. Signal Process. 59(1): 436-441 (2011) - 2010
- [i1]Richard P. Brent, Franklin T. Luk, H. T. Kung:
Some linear-time algorithms for systolic arrays. CoRR abs/1004.3716 (2010)
2000 – 2009
- 2008
- [c10]Daniel M. Tracy, W. Randolph Franklin, Barbara Cutler, Franklin T. Luk, Marcus V. A. Andrade:
Path planning on a compressed terrain. GIS 2008: 56 - 2005
- [j20]Raymond H. Chan, Wai-Ki Ching, Franklin T. Luk, Michael Kwok-Po Ng:
Structured matrices with applications. Numer. Linear Algebra Appl. 12(2-3): 87 (2005) - [c9]Zheng-Jian Bai, Raymond H. Chan, Franklin T. Luk:
Principal Component Analysis for Distributed Data Sets with Updating. APPT 2005: 471-483 - 2003
- [c8]Dickson K. W. Chiu, Wesley C. W. Chan, Gary K. W. Lam, Shing-Chi Cheung, Franklin T. Luk:
An Event Driven Approach to Customer Relationship Management in e-Brokerage Industry. HICSS 2003: 182
1990 – 1999
- 1996
- [j19]Franklin T. Luk, Sanzheng Qiao:
A symmetric rank-revealing toeplitz matrix decomposition. J. VLSI Signal Process. 14(1): 19-28 (1996) - 1994
- [j18]Franklin T. Luk, Sanzheng Qiao:
A new matrix decomposition for signal processing. Autom. 30(1): 39-43 (1994) - [j17]Gary E. Adams, Adam W. Bojanczyk, Franklin T. Luk:
Computing the PSVD of Two $2 \times 2$ Triangular Matrices. SIAM J. Matrix Anal. Appl. 15(2): 366-382 (1994) - 1993
- [j16]Franklin T. Luk, Sanzheng Qiao:
Analysis of a linearly constrained least squares algorithm for adaptive beamforming. Integr. 16(3): 235-245 (1993) - [c7]Tong J. Lee, Franklin T. Luk, Daniel Boley:
Singular Value Decomposition on a 2-D Fat-Tree Architecture. PPSC 1993: 358-362 - 1992
- [j15]Daniel Boley, Richard P. Brent, Gene H. Golub, Franklin T. Luk:
Algorithmic Fault Tolerance Using the Lanczos Method. SIAM J. Matrix Anal. Appl. 13(1): 312-332 (1992) - 1991
- [j14]Daniel Boley, Franklin T. Luk:
A well conditioned checksum scheme for algorithmic fault tolerance. Integr. 12(1): 21-32 (1991) - [j13]Adam W. Bojanczyk, Lars-Magnus Ewerbring, Franklin T. Luk, Paul Van Dooren:
An accurate product SVD algorithm. Signal Process. 25(2): 189-201 (1991) - 1990
- [j12]Adam W. Bojanczyk, Franklin T. Luk:
A Unified Systolic Array for Adaptive Beamforming. J. Parallel Distributed Comput. 8(4): 388-392 (1990) - [j11]Lars-Magnus Ewerbring, Franklin T. Luk:
Computing the Singular Value Decomposition on the Connection Machine. IEEE Trans. Computers 39(1): 152-155 (1990)
1980 – 1989
- 1989
- [j10]Franklin T. Luk, Haesun Park:
A Proof of Convergence for Two Parallel Jacobi SVD Algorithms. IEEE Trans. Computers 38(6): 806-811 (1989) - [j9]Franklin T. Luk, Eric K. Torng, Cynthia J. Anfinson:
A novel fault tolerance technique for recursive least squares minimization. J. VLSI Signal Process. 1(3): 181-188 (1989) - [c6]Lars-Magnus Ewerbring, Franklin T. Luk:
The HK Singular Value Decomposition of Rank Deficient Matrix Triplets. Great Lakes Computer Science Conference 1989: 286-292 - [c5]Cynthia J. Anfinson, Adam W. Bojanczyk, Franklin T. Luk, Eric K. Torng:
Algorithm-based fault-tolerant techniques for MVDR beamforming. ICASSP 1989: 2417-2420 - 1988
- [j8]Franklin T. Luk, Haesun Park:
An Analysis of Algorithm-Based Fault Tolerance Techniques. J. Parallel Distributed Comput. 5(2): 172-184 (1988) - [j7]Joseph R. Cavallaro, Franklin T. Luk:
CORDIC Arithmetic for an SVD Processor. J. Parallel Distributed Comput. 5(3): 271-290 (1988) - [j6]Franklin T. Luk, Haesun Park:
Fault-Tolerant Matrix Triangularizations on Systolic Arrays. IEEE Trans. Computers 37(11): 1434-1438 (1988) - [j5]Cynthia J. Anfinson, Franklin T. Luk:
A Linear Algebraic Model of Algorithm-Based Fault Tolerance. IEEE Trans. Computers 37(12): 1599-1604 (1988) - [c4]Joseph R. Cavallaro, Franklin T. Luk:
Floating point CORDIC for matrix computations. ICCD 1988: 40-42 - 1987
- [j4]Barry L. Drake, Franklin T. Luk, Jeffrey M. Speiser, Jerome J. Symanski:
SLAPP: A Systolic Linear Algebra Parallel Processor. Computer 20(7): 45-49 (1987) - [c3]Joseph R. Cavallaro, Franklin T. Luk:
CORDIC arithmetic for an SVD processor. IEEE Symposium on Computer Arithmetic 1987: 113-120 - 1985
- [j3]Franklin T. Luk:
A parallel method for computing the generalized singular value decomposition. J. Parallel Distributed Comput. 2(3): 250-260 (1985) - [c2]Franklin T. Luk:
A parallel method for computing the generalized singular value decomposition. IEEE Symposium on Computer Arithmetic 1985: 260-265 - 1983
- [c1]Richard P. Brent, H. T. Kung, Franklin T. Luk:
Some Linear-Time Algorithms for Systolic Arrays. IFIP Congress 1983: 865-876 - 1981
- [j2]Gene H. Golub, Franklin T. Luk, Michael L. Overton:
A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix. ACM Trans. Math. Softw. 7(2): 149-169 (1981) - 1980
- [j1]Franklin T. Luk:
Computing the Singular-Value Decomposition on the ILLIAC IV. ACM Trans. Math. Softw. 6(4): 524-539 (1980)
1970 – 1979
- 1978
- [b1]Franklin T. Luk:
Sparse and parallel matrix computations. Stanford University, USA, 1978
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
