Literatura académica sobre el tema "Tensors methods"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Tensors methods".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Tensors methods"
Katoch, Nitish, Bup-Kyung Choi, Ji-Ae Park, In-Ok Ko y Hyung-Joong Kim. "Comparison of Five Conductivity Tensor Models and Image Reconstruction Methods Using MRI". Molecules 26, n.º 18 (10 de septiembre de 2021): 5499. http://dx.doi.org/10.3390/molecules26185499.
Texto completoWang, Hai Jun, Fei Yun Xu y Fei Wang. "Tensor Factorization and Clustering for the Feature Extraction Based on Tucker3 with Updating Core". Advanced Materials Research 308-310 (agosto de 2011): 2517–22. http://dx.doi.org/10.4028/www.scientific.net/amr.308-310.2517.
Texto completoMoes, H., E. G. Sikkes y R. Bosma. "Mobility and Impedance Tensor Methods for Full and Partial-Arc Journal Bearings". Journal of Tribology 108, n.º 4 (1 de octubre de 1986): 612–19. http://dx.doi.org/10.1115/1.3261282.
Texto completoYang, Hye-Kyung y Hwan-Seung Yong. "Multi-Aspect Incremental Tensor Decomposition Based on Distributed In-Memory Big Data Systems". Journal of Data and Information Science 5, n.º 2 (20 de mayo de 2020): 13–32. http://dx.doi.org/10.2478/jdis-2020-0010.
Texto completoMoore, J. G., S. A. Schorn y J. Moore. "Education Committee Best Paper of 1995 Award: Methods of Classical Mechanics Applied to Turbulence Stresses in a Tip Leakage Vortex". Journal of Turbomachinery 118, n.º 4 (1 de octubre de 1996): 622–29. http://dx.doi.org/10.1115/1.2840917.
Texto completoXue, Zhaohui, Sirui Yang, Hongyan Zhang y Peijun Du. "Coupled Higher-Order Tensor Factorization for Hyperspectral and LiDAR Data Fusion and Classification". Remote Sensing 11, n.º 17 (21 de agosto de 2019): 1959. http://dx.doi.org/10.3390/rs11171959.
Texto completoHajarian, Masoud. "Solving coupled tensor equations via higher order LSQR methods". Filomat 34, n.º 13 (2020): 4419–27. http://dx.doi.org/10.2298/fil2013419h.
Texto completoZhong, Guoqiang y Mohamed Cheriet. "Large Margin Low Rank Tensor Analysis". Neural Computation 26, n.º 4 (abril de 2014): 761–80. http://dx.doi.org/10.1162/neco_a_00570.
Texto completoShi, Qiquan, Jiaming Yin, Jiajun Cai, Andrzej Cichocki, Tatsuya Yokota, Lei Chen, Mingxuan Yuan y Jia Zeng. "Block Hankel Tensor ARIMA for Multiple Short Time Series Forecasting". Proceedings of the AAAI Conference on Artificial Intelligence 34, n.º 04 (3 de abril de 2020): 5758–66. http://dx.doi.org/10.1609/aaai.v34i04.6032.
Texto completoDE AZCÁRRAGA, J. A. y A. J. MACFARLANE. "COMPILATION OF RELATIONS FOR THE ANTISYMMETRIC TENSORS DEFINED BY THE LIE ALGEBRA COCYCLES OF su(n)". International Journal of Modern Physics A 16, n.º 08 (30 de marzo de 2001): 1377–405. http://dx.doi.org/10.1142/s0217751x01003111.
Texto completoTesis sobre el tema "Tensors methods"
Handschuh, Stefan. "Numerical methods in Tensor Networks". Doctoral thesis, Universitätsbibliothek Leipzig, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-159672.
Texto completoWu, Yanqi. "New methods for measuring CSA tensors : applications to nucleotides and nucleosides". Thesis, University of Nottingham, 2011. http://eprints.nottingham.ac.uk/11859/.
Texto completoDamodaran, K. "Spatially dependent interaction tensors determined through novel methods of high resolution solid state NMR". Thesis(Ph.D.), CSIR-National Chemical Laboratory, Pune, 2006. http://dspace.ncl.res.in:8080/xmlui/handle/20.500.12252/2493.
Texto completoLund, Kathryn. "A new block Krylov subspace framework with applications to functions of matrices acting on multiple vectors". Diss., Temple University Libraries, 2018. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/493337.
Texto completoPh.D.
We propose a new framework for understanding block Krylov subspace methods, which hinges on a matrix-valued inner product. We can recast the ``classical" block Krylov methods, such as O'Leary's block conjugate gradients, global methods, and loop-interchange methods, within this framework. Leveraging the generality of the framework, we develop an efficient restart procedure and error bounds for the shifted block full orthogonalization method (Sh-BFOM(m)). Regarding BFOM as the prototypical block Krylov subspace method, we propose another formalism, which we call modified BFOM, and show that block GMRES and the new block Radau-Lanczos method can be regarded as modified BFOM. In analogy to Sh-BFOM(m), we develop an efficient restart procedure for shifted BGMRES with restarts (Sh-BGMRES(m)), as well as error bounds. Using this framework and shifted block Krylov methods with restarts as a foundation, we formulate block Krylov subspace methods with restarts for matrix functions acting on multiple vectors f(A)B. We obtain convergence bounds for \bfomfom (BFOM for Functions Of Matrices) and block harmonic methods (i.e., BGMRES-like methods) for matrix functions. With various numerical examples, we illustrate our theoretical results on Sh-BFOM and Sh-BGMRES. We also analyze the matrix polynomials associated to the residuals of these methods. Through a variety of real-life applications, we demonstrate the robustness and versatility of B(FOM)^2 and block harmonic methods for matrix functions. A particularly interesting example is the tensor t-function, our proposed definition for the function of a tensor in the tensor t-product formalism. Despite the lack of convergence theory, we also show that the block Radau-Lanczos modification can reduce the number of cycles required to converge for both linear systems and matrix functions.
Temple University--Theses
Savas, Berkant. "Algorithms in data mining using matrix and tensor methods". Doctoral thesis, Linköpings universitet, Beräkningsvetenskap, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-11597.
Texto completoFlores, Philippe. "Estimation of high dimensional probability density functions with low rank-tensors models : application to flow cytometry". Electronic Thesis or Diss., Université de Lorraine, 2024. http://www.theses.fr/2024LORR0021.
Texto completoFlow cytometry (FCM) is one of a most popular techniques for biological cells analysis. It is widely used in immunology, where it permits to make advances in leukemia research for example. The principle of FCM is to measure fluorescence properties for each cell present in a volume of cells. FCM data analysis permit to identify and characterize cell populations. Analysis performed manually rely on selection of cells plotted with bivariate plots. This operation, called gating, is time-consuming and introduces subjectivity. Although unsupervised methods exists, they are time-consuming and does not handle large datasets. To analyze FCM datasets, we decided to use a probabilistic approach. In that sense, the problem of FCM data analysis comes to an estimation of a probability density function. In the second and preliminary chapter, we present the problem of multivariate histogram estimation. This problem is considered impossible in practice because of the Curse of Dimensionality (CoD) which states that the complexity of a problem increases exponentially with the number of dimensions. To solve this issue, two solutions are performed in the litterature. First, the density is modelled with a naive Bayes model (NBM) whose complexity remains linear with the number of dimensions. Secondly, the factors of the NBM are obtained via a coupled tensor factorization algorithm. This method called CTF3D couples 3D marginals which are easy to compute with the amount of data available in FCM. However, CTF3D did not fully solved the CoD but instead moved it to another level: the number of 3D marginals. In a third chapter, we propose a new algorithm that solves the third level of CoD. This method called Partial Coupled Tensor Factorization of 3D marginals or PCTF3D is coupling subsets of 3D marginals. By choosing a subset of triplets hence the number of triplets, PCTF3D's complexity is reduced and controlled by end-users. The choice of triplets is called a coupling strategy and different strategies are presented with the formalism of hypergraphs. For example, random strategies consists in choosing triplets randomly. Balanced strategies consists in choosing triplets such that variables are represented evenly. An algorithm for balanced coupling generation is proposed. Finally, numerical experiments on real and synthetic datasets are performed. Our new method introduced a partially coupled tensor model. In the fourth chapter, we address the problem of uniqueness of this new model. First, recoverability is studied and an algorithm that finds the recoverability bound is presented. This algorithm is based on the study of the rank of the Jacobian of the parametrization. When applied to random couplings, defective cases are observed which leads to drops in recoverability bounds. Those cases are not observed for balanced couplings, making this strategy a good alternative for uniqueness guarantees. In a second part, the identifiability of the model was examined. We use previous proofs to demonstrate new identifiability sufficient conditions that exceed the conditions of the litterature. At last, our new histogram estimation method was used for FCM data analysis. We present Coupled Tensor factorization for Flow cytometry in High Dimensions or CTFlowHD: an unsupervised workflow for FCM data analysis. By considering a NBM for the cell distribution, NBM component are interpreted as cell groups which are represented by a proportion and a set of fluorescence properties. CTFlowHD uses PCTF3D to obtain the factors of the NBM. After this step, we present several tools for visualizing the rank-one terms. The main advantage of our method is that the visualization step can be applied without having to compute the NBM factors again. This permits to use various tools for visualization, especially tools already used in the FCM community. Finally, CTFlowHD is applied to real datasets
Bridgeman, Jacob. "Tensor Network Methods for Quantum Phases". Thesis, The University of Sydney, 2017. http://hdl.handle.net/2123/17647.
Texto completoGomes, Paulo Ricardo Barboza. "Tensor Methods for Blind Spatial Signature Estimation". Universidade Federal do CearÃ, 2014. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=11635.
Texto completoIn this dissertation the problem of spatial signature and direction of arrival estimation in Linear 2L-Shape and Planar arrays is investigated Methods based on tensor decompositions are proposed to treat the problem of estimating blind spatial signatures disregarding the use of training sequences and knowledge of the covariance structure of the sources By assuming that the power of the sources varies between successive time blocks decompositions for tensors of third and fourth orders obtained from spatial and spatio-temporal covariance of the received data in the array are proposed from which iterative algorithms are formulated to estimate spatial signatures of the sources Then greater spatial diversity is achieved by using the Spatial Smoothing in the 2L-Shape and Planar arrays In that case the estimation of the direction of arrival of the sources can not be obtained directly from the formulated algorithms The factorization of the Khatri-Rao product is then incorporated into these algorithms making it possible extracting estimates for the azimuth and elevation angles from matrices obtained using this method A distinguishing feature of the proposed tensor methods is their efficiency to treat the cases where the covariance matrix of the sources is non-diagonal and unknown which generally happens when working with sample data covariances computed from a reduced number of snapshots
Nesta dissertaÃÃo o problema de estimaÃÃo de assinaturas espaciais e consequentemente da direÃÃo de chegada dos sinais incidentes em arranjos Linear 2L-Shape e Planar à investigado MÃtodos baseados em decomposiÃÃes tensoriais sÃo propostos para tratar o problema de estimaÃÃo cega de assinaturas espaciais desconsiderando a utilizaÃÃo de sequÃncias de treinamento e o conhecimento da estrutura de covariÃncia das fontes Ao assumir que a potÃncia das fontes varia entre blocos de tempos sucessivos decomposiÃÃes para tensores de terceira e quarta ordem obtidas a partir da covariÃncia espacial e espaÃo-temporal dos dados recebidos no arranjo de sensores sÃo propostas a partir das quais algoritmos iterativos sÃo formulados para estimar a assinatura espacial das fontes em seguida uma maior diversidade espacial à alcanÃada utilizando a tÃcnica Spatial Smoothing na recepÃÃo de sinais nos arranjos 2L-Shape e Planar Nesse caso as estimaÃÃes da direÃÃo de chegada das fontes nÃo podem ser obtidas diretamente a partir dos algoritmos formulados de forma que a fatoraÃÃo do produto de Khatri-Rao à incorporada a estes algoritmos tornando possÃvel a obtenÃÃo de estimaÃÃes para os Ãngulos de azimute e elevaÃÃo a partir das matrizes obtidas utilizando este mÃtodo Uma caracterÃstica marcante dos mÃtodos tensoriais propostos està presente na eficiÃncia obtida no tratamento de casos em que a matriz de covariÃncia das fontes à nÃo-diagonal e desconhecida o que geralmente ocorre quando se trabalha com covariÃncias de amostras reais calculadas a partir de um nÃmero reduzido de snapshots
Hibraj, Feliks <1995>. "Efficient tensor kernel methods for sparse regression". Master's Degree Thesis, Università Ca' Foscari Venezia, 2020. http://hdl.handle.net/10579/16921.
Texto completoRabusseau, Guillaume. "A tensor perspective on weighted automata, low-rank regression and algebraic mixtures". Thesis, Aix-Marseille, 2016. http://www.theses.fr/2016AIXM4062.
Texto completoThis thesis tackles several problems exploring connections between tensors and machine learning. In the first chapter, we propose an extension of the classical notion of recognizable function on strings and trees to graphs. We first show that the computations of weighted automata on strings and trees can be interpreted in a natural and unifying way using tensor networks, which naturally leads us to define a computational model on graphs: graph weighted models; we then study fundamental properties of this model and present preliminary learning results. The second chapter tackles a model reduction problem for weighted tree automata. We propose a principled approach to the following problem: given a weighted tree automaton with n states, how can we find an automaton with m
Libros sobre el tema "Tensors methods"
P, Miles J., ed. Tensor methods for engineers. New York: Ellis Horwood, 1990.
Buscar texto completoTensor methods in statistics. London: Chapman and Hall, 1987.
Buscar texto completoBorg, Sidney F. Matrix-tensor methods in continuum mechanics. 2a ed. Singapore: World Scientific, 1990.
Buscar texto completoAn introduction to tensors and group theory for physicists. New York: Birkhäuser, 2011.
Buscar texto completoMontangero, Simone. Introduction to Tensor Network Methods. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-01409-4.
Texto completoGriffith, J. S. The irreducible tensor method for molecular symmetry groups. Mineola, NY: Dover Publications, 2006.
Buscar texto completoH, Pulliam Thomas y Research Institute for Advanced Computer Science (U.S.), eds. Tensor-GMRES method for large sparse systems of nonlinear equations. [Moffett Field, Calif.]: Research Institute for Advanced Computer Science, NASA Ames Research Center, 1994.
Buscar texto completoGreenblatt, Seth A. Tensor methods for full-information maximum likelihood estimation: Unconstrained estimation. Reading: University of Reading. Department of Economics, 1992.
Buscar texto completo1968-, VanPool Todd L. y VanPool Christine S. 1969-, eds. Essential tensions in archaeological method and theory. Salt Lake City: University of Utah Press, 2003.
Buscar texto completoGiraldo, Francis X. An Introduction to Element-Based Galerkin Methods on Tensor-Product Bases. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-55069-1.
Texto completoCapítulos de libros sobre el tema "Tensors methods"
Chaves, Eduardo W. V. "Tensors". En Lecture Notes on Numerical Methods in Engineering and Sciences, 9–144. Dordrecht: Springer Netherlands, 2013. http://dx.doi.org/10.1007/978-94-007-5986-2_2.
Texto completoDubrovin, B. A., S. P. Novikov y A. T. Fomenko. "Tensors: The Algebraic Theory". En Modern Geometry — Methods and Applications, 145–237. New York, NY: Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4612-4398-4_3.
Texto completoLohmann, Christoph. "Limiting for tensors". En Physics-Compatible Finite Element Methods for Scalar and Tensorial Advection Problems, 151–210. Wiesbaden: Springer Fachmedien Wiesbaden, 2019. http://dx.doi.org/10.1007/978-3-658-27737-6_5.
Texto completoDubrovin, B. A., S. P. Novikov y A. T. Fomenko. "The Differential Calculus of Tensors". En Modern Geometry — Methods and Applications, 238–316. New York, NY: Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4612-4398-4_4.
Texto completoChaves, Eduardo W. V. "The Objectivity of Tensors". En Lecture Notes on Numerical Methods in Engineering and Sciences, 269–84. Dordrecht: Springer Netherlands, 2013. http://dx.doi.org/10.1007/978-94-007-5986-2_5.
Texto completoWiśniewski, K. "Operations on tensors and their representations". En Lecture Notes on Numerical Methods in Engineering and Sciences, 6–20. Dordrecht: Springer Netherlands, 2009. http://dx.doi.org/10.1007/978-90-481-8761-4_2.
Texto completoMardal, Kent-André, Marie E. Rognes, Travis B. Thompson y Lars Magnus Valnes. "Introducing Directionality with Diffusion Tensors". En Mathematical Modeling of the Human Brain, 81–96. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-95136-8_5.
Texto completoWinholtz, R. A. y A. D. Krawitz. "Methods for Depth Profiling Complete Stress Tensors Using Neutron Diffraction". En Advances in X-Ray Analysis, 253–64. Boston, MA: Springer US, 1994. http://dx.doi.org/10.1007/978-1-4615-2528-8_33.
Texto completoZhang, Yedi, Fu Song y Jun Sun. "QEBVerif: Quantization Error Bound Verification of Neural Networks". En Computer Aided Verification, 413–37. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37703-7_20.
Texto completoBahadır, Oguzhan. "Curvature Tensors of Screen Semi-invariant Half-Lightlike Submanifolds of a Semi-Riemannian Product Manifold with Quarter-Symmetric Non-metric Connection". En Mathematical Methods and Modelling in Applied Sciences, 136–46. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43002-3_13.
Texto completoActas de conferencias sobre el tema "Tensors methods"
Jack, David A. y Douglas E. Smith. "Assessing the Use of Tensor Closure Methods With Orientation Distribution Reconstruction Functions". En ASME 2003 International Mechanical Engineering Congress and Exposition. ASMEDC, 2003. http://dx.doi.org/10.1115/imece2003-42828.
Texto completoMoore, Joan G., Scott A. Schorn y John Moore. "Methods of Classical Mechanics Applied to Turbulence Stresses in a Tip Leakage Vortex". En ASME 1995 International Gas Turbine and Aeroengine Congress and Exposition. American Society of Mechanical Engineers, 1995. http://dx.doi.org/10.1115/95-gt-220.
Texto completoKannan, Ravindran. "Spectral methods for matrices and tensors". En the 42nd ACM symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1806689.1806691.
Texto completoNajafi, Mehrnaz, Lifang He y Philip S. Yu. "Outlier-Robust Multi-Aspect Streaming Tensor Completion and Factorization". En Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/442.
Texto completo"Session MA1b: Tensors methods in signal processing". En 2010 44th Asilomar Conference on Signals, Systems and Computers. IEEE, 2010. http://dx.doi.org/10.1109/acssc.2010.5757212.
Texto completoZhang, Yuan y Regina Barzilay. "Hierarchical Low-Rank Tensors for Multilingual Transfer Parsing". En Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing. Stroudsburg, PA, USA: Association for Computational Linguistics, 2015. http://dx.doi.org/10.18653/v1/d15-1213.
Texto completoBabudzhan, Ruslan y Oleksii Vodka. "Comparison of Glyph Visualization Methods for Structural Stress Tensors". En 2021 IEEE 2nd KhPI Week on Advanced Technology (KhPIWeek). IEEE, 2021. http://dx.doi.org/10.1109/khpiweek53812.2021.9569986.
Texto completoPolajnar, Tamara, Luana Fagarasan y Stephen Clark. "Reducing Dimensions of Tensors in Type-Driven Distributional Semantics". En Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP). Stroudsburg, PA, USA: Association for Computational Linguistics, 2014. http://dx.doi.org/10.3115/v1/d14-1111.
Texto completoYang, Chaoqi, Cheng Qian y Jimeng Sun. "GOCPT: Generalized Online Canonical Polyadic Tensor Factorization and Completion". En Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/326.
Texto completoKo, Ching Yun, Rui Lin, Shu Li y Ngai Wong. "MiSC: Mixed Strategies Crowdsourcing". En Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/193.
Texto completoInformes sobre el tema "Tensors methods"
Bouaricha, A. Tensor methods for large, sparse unconstrained optimization. Office of Scientific and Technical Information (OSTI), noviembre de 1996. http://dx.doi.org/10.2172/409872.
Texto completoSchnabel, Robert B. y Ta-Tung Chow. Tensor Methods for Unconstrained Optimization Using Second Derivatives. Fort Belvoir, VA: Defense Technical Information Center, julio de 1989. http://dx.doi.org/10.21236/ada213642.
Texto completoSchnabel, Robert B. y Paul D. Frank. Solving Systems of Nonlinear Equations by Tensor Methods. Fort Belvoir, VA: Defense Technical Information Center, junio de 1986. http://dx.doi.org/10.21236/ada169927.
Texto completoMayo, Jackson R. y Tamara Gibson Kolda. Shifted power method for computing tensor eigenpairs. Office of Scientific and Technical Information (OSTI), octubre de 2010. http://dx.doi.org/10.2172/1005408.
Texto completoBouaricha, A. y R. B. Schnabel. Tensor methods for large sparse systems of nonlinear equations. Office of Scientific and Technical Information (OSTI), diciembre de 1996. http://dx.doi.org/10.2172/434848.
Texto completoHaass, Michael Joseph, Mark Hilary Van Benthem y Edward M. Ochoa. Tensor analysis methods for activity characterization in spatiotemporal data. Office of Scientific and Technical Information (OSTI), marzo de 2014. http://dx.doi.org/10.2172/1200656.
Texto completoChow, Ta-Tung, Elizabeth Eskow y Robert B. Schnabel. A Software Package for Unconstrained Optimization Using Tensor Methods. Fort Belvoir, VA: Defense Technical Information Center, diciembre de 1990. http://dx.doi.org/10.21236/ada233989.
Texto completoBader, Brett William. Tensor-Krylov methods for solving large-scale systems of nonlinear equations. Office of Scientific and Technical Information (OSTI), agosto de 2004. http://dx.doi.org/10.2172/919158.
Texto completoSchnabel, Robert B. y Brett William Bader. On the performance of tensor methods for solving ill-conditioned problems. Office of Scientific and Technical Information (OSTI), septiembre de 2004. http://dx.doi.org/10.2172/919164.
Texto completoManke, J. A tensor product B-spline method for numerical grid generation. Office of Scientific and Technical Information (OSTI), octubre de 1989. http://dx.doi.org/10.2172/5005256.
Texto completo