Extrapolated Alternating Algorithms for Approximate Canonical Polyadic Decomposition

doi 10.1109/icassp40776.2020.9053849
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

A Coupled Joint Eigenvalue Decomposition Algorithm for Canonical Polyadic Decomposition of Tensors

2016English

Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2013English

Iterative Algorithms to Approximate Canonical Gabor Windows: Computational Aspects

Journal of Fourier Analysis and Applications
MathematicsApplied MathematicsAnalysis
2007English

Shift-Invariant Canonical Polyadic Decomposition of Complex-Valued Multi-Subject fMRI Data With a Phase Sparsity Constraint

IEEE Transactions on Medical Imaging
Electronic EngineeringUltrasound TechnologyRadiologicalComputer Science ApplicationsElectricalSoftware
2020English

Computing the Polyadic Decomposition of Nonnegative Third Order Tensors

Signal Processing
ControlSystems EngineeringPattern RecognitionElectronic EngineeringComputer VisionElectricalSignal ProcessingSoftware
2011English

Vector Algorithms for Approximate String Matching

International Journal of Foundations of Computer Science
Computer Science
2002English

Fast Algorithms for Approximate Circular String Matching

Algorithms for Molecular Biology
Computational TheoryApplied MathematicsStructural BiologyMolecular BiologyMathematics
2014English

An Alternating Direction Nonmonotone Approximate Newton Algorithm for Inverse Problems

Journal of Applied Mathematics and Physics
2016English

Canonical Decomposition of Steerable Functions

1996English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy