Hello,
My name is Asaro Hong, an M.S. student in Mechanical Engineering at Inha University.
In P2D lithium-ion battery model calculations, I frequently use cumsum on 1D vectors. I’d like to confirm the following:
What is the time complexity (Big-O) of cumsum with respect to input length n?
With Parallel Computing Toolbox or when using GPU arrays (gpuArray), are there documented differences in time complexity or constant factors/overhead?
For citation in a paper, could you point me to any official references (product documentation, technical notes, benchmark materials, etc.)?
Environment: MATLAB R2024a, Windows 10
Thank you for your help.Hello,
My name is Asaro Hong, an M.S. student in Mechanical Engineering at Inha University.
In P2D lithium-ion battery model calculations, I frequently use cumsum on 1D vectors. I’d like to confirm the following:
What is the time complexity (Big-O) of cumsum with respect to input length n?
With Parallel Computing Toolbox or when using GPU arrays (gpuArray), are there documented differences in time complexity or constant factors/overhead?
For citation in a paper, could you point me to any official references (product documentation, technical notes, benchmark materials, etc.)?
Environment: MATLAB R2024a, Windows 10
Thank you for your help. Hello,
My name is Asaro Hong, an M.S. student in Mechanical Engineering at Inha University.
In P2D lithium-ion battery model calculations, I frequently use cumsum on 1D vectors. I’d like to confirm the following:
What is the time complexity (Big-O) of cumsum with respect to input length n?
With Parallel Computing Toolbox or when using GPU arrays (gpuArray), are there documented differences in time complexity or constant factors/overhead?
For citation in a paper, could you point me to any official references (product documentation, technical notes, benchmark materials, etc.)?
Environment: MATLAB R2024a, Windows 10
Thank you for your help. algorithm MATLAB Answers — New Questions

​