Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 576489
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 13, 20262026-05-13T14:03:09+00:00 2026-05-13T14:03:09+00:00

I’m using a block processing approach to handle a calculation between two large matrices.

  • 0

I’m using a block processing approach to handle a calculation between two large matrices.

The code significantly speeds up when using a larger block size. But if I go too large, then I get an Out of Memory error. Currently I hand-tune my code to find the largest working block size for a given input.

My question: how can I automate the process of finding the largest possible block size?

I’ve toyed with wrapping everything in a try/catch block and looping with progressively smaller block sizes till it succeeds. I’m hoping there is a more elegant or idiomatic way.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-13T14:03:09+00:00Added an answer on May 13, 2026 at 2:03 pm

    Before doing the block processing, you can use the MEMORY function to see how much memory is already being used and how much is left available for any additional variables the block processing may need to create. If you can estimate the total amount of memory the block processing steps will need as a function of the block size, you can figure out how large the block size can be before you run out of available memory. This may be easier said than done, since I don’t know exactly how you are doing the block processing.

    Here’s a simple example. I’ll start by clearing the workspace and creating 2 large matrices:

    >> clear all
    >> mat1 = zeros(8000);  %# An 8000-by-8000 matrix of doubles
    >> mat2 = zeros(8000);  %# Another 8000-by-8000 matrix of doubles
    

    Now, let’s say I know I will have to allocate an N-by-N matrix of doubles, which will require 8*N*N bytes of memory (8 bytes per double). I can do the following to find out how large I can make N:

    >> uV = memory  %# Get the memory statistics
    
    uV = 
    
        MaxPossibleArrayBytes: 314990592
        MemAvailableAllArrays: 643969024
                MemUsedMATLAB: 1.2628e+009
    
    >> maxN = floor(sqrt(uV.MaxPossibleArrayBytes/8))  %# Compute the maximum N
    
    maxN =
    
            6274
    
    >> mat3 = ones(maxN);    %# Works fine
    >> mat3 = ones(maxN+1);  %# Tanks! Too large!
    ??? Out of memory. Type HELP MEMORY for your options.
    

    If you are routinely having trouble with running out of memory, here are a couple of things you can do:

    • Use single precision (or integer types) for large matrices instead of the default double precision.
    • Be sure to clear variables you don’t need anymore (especially if they are large).
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Ask A Question

Stats

  • Questions 308k
  • Answers 308k
  • Best Answers 0
  • User 1
  • Popular
  • Answers
  • Editorial Team

    How to approach applying for a job at a company ...

    • 7 Answers
  • Editorial Team

    What is a programmer’s life like?

    • 5 Answers
  • Editorial Team

    How to handle personal stress caused by utterly incompetent and ...

    • 5 Answers
  • Editorial Team
    Editorial Team added an answer Under Linux/Unix (BSD, OS X, POSIX, etc.) you can use… May 13, 2026 at 9:37 pm
  • Editorial Team
    Editorial Team added an answer I maybe wrong on this, I have only used Subsonic… May 13, 2026 at 9:37 pm
  • Editorial Team
    Editorial Team added an answer you can use the sqlcommand's BeginExecuteReader to get an asynch… May 13, 2026 at 9:37 pm

Related Questions

In order to apply a triggered animation to all ToolTip s in my app,
I ran into a problem. Wrote the following code snippet: teksti = teksti.Trim() teksti
I want use html5's new tag to play a wav file (currently only supported
I'm trying to decode HTML entries from here NYTimes.com and I cannot figure out
I've got a string that has curly quotes in it. I'd like to replace

Trending Tags

analytics british company computer developers django employee employer english facebook french google interview javascript language life php programmer programs salary

Top Members

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.