output
20052026
most citedWhat are the main drivers of the Bitcoin price? Evidence from wavelet coherence analysis

999 citations

Showing math.NAShow all

10 papers · 1 filter

math.NA2021★ 6 cited

Minimization of p-Laplacian via the Finite Element Method in MATLAB

Ctirad Matonoha, Alexej Moskovka, Jan Valdman

Minimization of energy functionals is based on a discretization by the finite element method and optimization by the trust-region method. A key tool is a local evaluation of the ap…

math.NA2018

Efficient and flexible MATLAB implementation of 2D and 3D elastoplastic problems

Martin Čermák, Stanislav Sysala, Jan Valdman

We propose an effective and flexible way to implement 2D and 3D elastoplastic problems in MATLAB using fully vectorized codes. Our technique is applied to a broad class of the prob…

math.NA2016

Computational modeling of magnetic hysteresis with thermal effects

Martin Kružík, Jan Valdman

We study computational behavior of a mesoscopic model describing temperature/external magnetic field-driven evolution of magnetization. Due to nonconvex anisotropy energy describin…

math.NA2015★ 3 cited

Perfect plasticity with damage and healing at small strains, its modelling, analysis, and computer implementation

Tomáš Roubíček, Jan Valdman

The quasistatic, Prandtl-Reuss perfect plasticity at small strains is combined with a gradient, reversible (i.e. admitting healing) damage which influences both the elastic moduli…

math.NA2014★ 2 cited

Additive Schwarz preconditioner for the general finite volume element discretization of symmetric elliptic problems

Leszek Marcinkowski, Talal Rahman, Atle Loneland +1

A symmetric and a nonsymmetric variant of the additive Schwarz preconditioner are proposed for the solution of a nonsymmetric system of algebraic equations arising from a general f…

math.NA2013★ 1 cited

Max-min and min-max approximation problems for normal matrices revisited

Jörg Liesen, Petr Tichý

We give a new proof for an equality of certain max-min and min-max approximation problems involving normal matrices. The previously published proofs of this equality apply tools fr…

math.NA2012★ 68 cited

CANDECOMP/PARAFAC Decomposition of High-order Tensors Through Tensor Reshaping

Anh Huy Phan, Petr Tichavsky, Andrzej Cichocki

In general, algorithms for order-3 CANDECOMP/-PARAFAC (CP), also coined canonical polyadic decomposition (CPD), are easily to implement and can be extended to higher order CPD. Unf…

math.NA2012★ 1 cited

Low Complexity Damped Gauss-Newton Algorithms for CANDECOMP/PARAFAC

Anh Huy Phan, Petr Tichavský, Andrzej Cichocki

The damped Gauss-Newton (dGN) algorithm for CANDECOMP/PARAFAC (CP) decomposition can handle the challenges of collinearity of factors and different magnitudes of factors; neverthel…

math.NA2012★ 3 cited

A TFETI Domain Decomposition Solver for Elastoplastic Problems

M. Čermák, T. Kozubek, S. Sysala +1

We propose an algorithm for the efficient parallel implementation of elastoplastic problems with hardening based on the so-called TFETI (Total Finite Element Tearing and Interconne…

math.NA2012★ 17 cited

On Fast Computation of Gradients for CANDECOMP/PARAFAC Algorithms

Anh Huy Phan, Petr Tichavský, Andrzej Cichocki

Product between mode- unfolding $\bY_{(n)}$ of an -D tensor $\tY$ and Khatri-Rao products of factor matrices $\bA^{(m)}$, exists in algo…